/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/sina4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:50:27,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:50:27,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:50:27,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:50:27,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:50:27,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:50:27,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:50:27,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:50:27,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:50:27,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:50:27,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:50:27,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:50:27,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:50:27,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:50:27,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:50:27,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:50:27,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:50:27,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:50:27,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:50:27,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:50:27,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:50:27,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:50:27,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:50:27,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:50:27,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:50:27,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:50:27,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:50:27,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:50:27,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:50:27,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:50:27,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:50:27,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:50:27,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:50:27,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:50:27,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:50:27,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:50:27,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:50:27,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:50:27,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:50:27,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:50:27,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:50:27,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:50:27,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:50:27,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:50:27,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:50:27,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:50:27,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:50:27,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:50:27,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:50:27,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:50:27,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:50:27,848 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:50:27,848 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 11:50:28,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:50:28,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:50:28,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:50:28,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:50:28,042 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:50:28,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina4.c [2022-01-31 11:50:28,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21742b4d8/2f3988b70ca04ec1b8d7d477ae8a85bb/FLAGd9571b600 [2022-01-31 11:50:28,443 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:50:28,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c [2022-01-31 11:50:28,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21742b4d8/2f3988b70ca04ec1b8d7d477ae8a85bb/FLAGd9571b600 [2022-01-31 11:50:28,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21742b4d8/2f3988b70ca04ec1b8d7d477ae8a85bb [2022-01-31 11:50:28,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:50:28,459 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:50:28,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:50:28,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:50:28,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:50:28,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d939c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28, skipping insertion in model container [2022-01-31 11:50:28,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:50:28,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:50:28,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c[588,601] [2022-01-31 11:50:28,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:50:28,612 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:50:28,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c[588,601] [2022-01-31 11:50:28,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:50:28,636 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:50:28,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28 WrapperNode [2022-01-31 11:50:28,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:50:28,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:50:28,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:50:28,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:50:28,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:50:28,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:50:28,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:50:28,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:50:28,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:50:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:28,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 11:50:28,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:50:28,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:50:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:50:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:50:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:50:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:50:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:50:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:50:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:50:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:50:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:50:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:50:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:50:28,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:50:28,809 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:50:28,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:50:28,962 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:50:28,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:50:28,966 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 11:50:28,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:28 BoogieIcfgContainer [2022-01-31 11:50:28,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:50:28,968 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:50:28,968 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:50:28,969 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:50:28,971 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:28" (1/1) ... [2022-01-31 11:50:28,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:50:28 BasicIcfg [2022-01-31 11:50:28,983 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:50:28,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:50:28,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:50:28,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:50:28,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:50:28" (1/4) ... [2022-01-31 11:50:28,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5b0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:50:28, skipping insertion in model container [2022-01-31 11:50:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:28" (2/4) ... [2022-01-31 11:50:28,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5b0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:50:28, skipping insertion in model container [2022-01-31 11:50:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:28" (3/4) ... [2022-01-31 11:50:28,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5b0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:50:28, skipping insertion in model container [2022-01-31 11:50:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:50:28" (4/4) ... [2022-01-31 11:50:28,987 INFO L111 eAbstractionObserver]: Analyzing ICFG sina4.cJordan [2022-01-31 11:50:28,990 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:50:28,990 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:50:29,015 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:50:29,019 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 11:50:29,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:50:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:50:29,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:29,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:29,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1091141799, now seen corresponding path program 1 times [2022-01-31 11:50:29,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659418415] [2022-01-31 11:50:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:29,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:29,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:29,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659418415] [2022-01-31 11:50:29,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659418415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:50:29,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:50:29,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:50:29,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650218318] [2022-01-31 11:50:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:50:29,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:50:29,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:50:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:50:29,247 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:29,316 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-01-31 11:50:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:50:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-31 11:50:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:29,324 INFO L225 Difference]: With dead ends: 40 [2022-01-31 11:50:29,325 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:50:29,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:50:29,328 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:29,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:50:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:50:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 11:50:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 11:50:29,350 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-01-31 11:50:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:29,351 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 11:50:29,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 11:50:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:50:29,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:29,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:29,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:50:29,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -565853652, now seen corresponding path program 1 times [2022-01-31 11:50:29,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:29,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061656932] [2022-01-31 11:50:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:29,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:29,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061656932] [2022-01-31 11:50:29,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061656932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:50:29,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:50:29,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:50:29,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196514859] [2022-01-31 11:50:29,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:50:29,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:50:29,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:50:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:50:29,456 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:50:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:29,565 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-31 11:50:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:50:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-31 11:50:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:29,568 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:50:29,568 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:50:29,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:50:29,569 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:29,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 33 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:50:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:50:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-01-31 11:50:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 11:50:29,575 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-01-31 11:50:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:29,575 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 11:50:29,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:50:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 11:50:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:50:29,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:29,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:29,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:50:29,577 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash -952007550, now seen corresponding path program 1 times [2022-01-31 11:50:29,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:29,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383763266] [2022-01-31 11:50:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:29,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:30,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:30,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383763266] [2022-01-31 11:50:30,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383763266] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:30,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745616409] [2022-01-31 11:50:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:30,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:30,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:30,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:30,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 11:50:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:30,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 11:50:30,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:30,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:50:30,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:50:30,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:30,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-31 11:50:30,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2022-01-31 11:50:30,967 INFO L353 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2022-01-31 11:50:30,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2022-01-31 11:50:31,340 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:31,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 48 [2022-01-31 11:50:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:31,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:41,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:41,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745616409] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:41,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:41,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 37 [2022-01-31 11:50:41,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050855137] [2022-01-31 11:50:41,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:41,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 11:50:41,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:41,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 11:50:41,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1176, Unknown=5, NotChecked=0, Total=1332 [2022-01-31 11:50:41,932 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:50:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:42,371 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-01-31 11:50:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:50:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-31 11:50:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:42,372 INFO L225 Difference]: With dead ends: 66 [2022-01-31 11:50:42,372 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 11:50:42,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=204, Invalid=1597, Unknown=5, NotChecked=0, Total=1806 [2022-01-31 11:50:42,374 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:42,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 179 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 487 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2022-01-31 11:50:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 11:50:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-01-31 11:50:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-01-31 11:50:42,379 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2022-01-31 11:50:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:42,380 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-01-31 11:50:42,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:50:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-01-31 11:50:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:50:42,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:42,381 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:42,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 11:50:42,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:42,592 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1786778562, now seen corresponding path program 2 times [2022-01-31 11:50:42,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:42,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269971187] [2022-01-31 11:50:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:42,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:42,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:42,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269971187] [2022-01-31 11:50:42,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269971187] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:42,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455491487] [2022-01-31 11:50:42,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:50:42,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:42,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:42,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:42,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 11:50:42,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:50:42,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:42,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:50:42,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:42,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:42,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455491487] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:42,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:42,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:50:42,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236801178] [2022-01-31 11:50:42,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:42,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:50:42,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:50:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:50:42,876 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:43,085 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-01-31 11:50:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:50:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 11:50:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:43,090 INFO L225 Difference]: With dead ends: 80 [2022-01-31 11:50:43,090 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 11:50:43,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:50:43,096 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:43,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 83 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:50:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 11:50:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-01-31 11:50:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 57 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-01-31 11:50:43,102 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 36 [2022-01-31 11:50:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:43,102 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-01-31 11:50:43,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-01-31 11:50:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:50:43,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:43,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:43,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:43,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 11:50:43,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:43,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1321507392, now seen corresponding path program 3 times [2022-01-31 11:50:43,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:43,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530405890] [2022-01-31 11:50:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:43,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:43,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530405890] [2022-01-31 11:50:43,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530405890] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649458957] [2022-01-31 11:50:43,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:50:43,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:43,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:43,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:43,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 11:50:43,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:50:43,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:43,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:50:43,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:43,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:50:43,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649458957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:43,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:43,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:50:43,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392029246] [2022-01-31 11:50:43,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:43,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:50:43,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:50:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:50:43,549 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:43,709 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-01-31 11:50:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:50:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 11:50:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:43,710 INFO L225 Difference]: With dead ends: 81 [2022-01-31 11:50:43,710 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:50:43,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:50:43,711 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:43,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 76 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:50:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:50:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-01-31 11:50:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 11:50:43,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 36 [2022-01-31 11:50:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:43,715 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 11:50:43,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 11:50:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:50:43,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:43,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:43,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:43,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:43,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1683451304, now seen corresponding path program 4 times [2022-01-31 11:50:43,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:43,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265882356] [2022-01-31 11:50:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:43,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:44,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265882356] [2022-01-31 11:50:44,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265882356] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914943320] [2022-01-31 11:50:44,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:50:44,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:44,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:44,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 11:50:44,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:50:44,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:44,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 11:50:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:44,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:50:45,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:45,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 11:50:45,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:45,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 11:50:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-31 11:50:45,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:45,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-31 11:50:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,830 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:50:45,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-01-31 11:50:45,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:45,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:45,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:46,004 INFO L353 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-01-31 11:50:46,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2022-01-31 11:50:46,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:46,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:46,352 INFO L353 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-01-31 11:50:46,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-01-31 11:50:46,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:46,824 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:46,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-01-31 11:50:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:46,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:49,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* v_main_~i~0_67 8) c_main_~b~0.offset) v_ArrVal_227) c_main_~b~0.offset))))) is different from false [2022-01-31 11:51:21,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_70 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_70)) (forall ((v_ArrVal_224 Int) (main_~b~0.base Int) (v_main_~i~0_67 Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_70 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse0) main_~b~0.base) c_main_~b~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_67 8) c_main_~b~0.offset) v_ArrVal_227) c_main_~b~0.offset)) (not (<= 1 v_main_~i~0_67)))))) is different from false [2022-01-31 11:51:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 11:51:43,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914943320] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:43,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:51:43,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 24] total 68 [2022-01-31 11:51:43,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54806442] [2022-01-31 11:51:43,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:43,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:51:43,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:51:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3959, Unknown=26, NotChecked=258, Total=4556 [2022-01-31 11:51:43,045 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 68 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:46,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse3 (+ c_main_~a~0.offset (* c_main_~i~0 8))) (.cse11 (select .cse10 0))) (let ((.cse0 (+ c_~N~0 1)) (.cse5 (+ c_~N~0 .cse11)) (.cse6 (= .cse11 1)) (.cse7 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse8 (not (= 8 .cse3))) (.cse1 (select .cse10 .cse3))) (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (<= c_main_~i~0 1) (<= c_~N~0 2) (<= .cse0 .cse1) (<= .cse1 .cse0) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= c_main_~b~0.offset 0) (forall ((v_main_~i~0_70 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_70)) (forall ((v_ArrVal_224 Int) (main_~b~0.base Int) (v_main_~i~0_67 Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse2 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_70 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse2) main_~b~0.base) c_main_~b~0.offset (+ (select .cse2 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_67 8) c_main_~b~0.offset) v_ArrVal_227) c_main_~b~0.offset)) (not (<= 1 v_main_~i~0_67)))))) (or (not (<= .cse3 7)) (<= 2 c_~N~0)) (or (let ((.cse4 (+ .cse7 2))) (and (= .cse1 1) (<= .cse4 .cse5) (<= .cse5 .cse4) .cse6)) .cse8) (or (let ((.cse9 (+ .cse7 1))) (and (<= .cse5 .cse9) (<= .cse9 .cse5) .cse6)) .cse8) (= (select .cse10 (+ c_main_~a~0.offset 8)) 1) (= (+ (- 2) .cse1) 1))))) is different from false [2022-01-31 11:51:48,330 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (<= c_~N~0 2) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 2)) 1) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= c_main_~b~0.offset 0) (forall ((v_main_~i~0_70 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_70)) (forall ((v_ArrVal_224 Int) (main_~b~0.base Int) (v_main_~i~0_67 Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_70 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse0) main_~b~0.base) c_main_~b~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_67 8) c_main_~b~0.offset) v_ArrVal_227) c_main_~b~0.offset)) (not (<= 1 v_main_~i~0_67))))))) is different from false [2022-01-31 11:51:50,403 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 8) c_main_~b~0.offset)))) (and (<= c_~N~0 2) (= .cse0 4) (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* v_main_~i~0_67 8) c_main_~b~0.offset) v_ArrVal_227) c_main_~b~0.offset))))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= (+ c_~N~0 2) .cse0) (< 1 c_~N~0) (= c_main_~b~0.offset 0) (exists ((|main_~#sum~0.base| Int) (main_~a~0.base Int)) (and (or (= 3 (select (select |c_#memory_int| main_~a~0.base) (* c_main_~i~0 8))) (= c_main_~b~0.base main_~a~0.base)) (< (+ main_~a~0.base 1) |main_~#sum~0.base|) (or (exists ((|main_~#sum~0.offset| Int)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2)) (= c_main_~b~0.base |main_~#sum~0.base|)))))) is different from false [2022-01-31 11:52:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:16,373 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-01-31 11:52:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 11:52:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:52:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:16,375 INFO L225 Difference]: With dead ends: 89 [2022-01-31 11:52:16,375 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 11:52:16,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=419, Invalid=5558, Unknown=49, NotChecked=780, Total=6806 [2022-01-31 11:52:16,378 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:16,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 319 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 580 Invalid, 0 Unknown, 634 Unchecked, 0.3s Time] [2022-01-31 11:52:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 11:52:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2022-01-31 11:52:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:52:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-01-31 11:52:16,382 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 42 [2022-01-31 11:52:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:16,383 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-01-31 11:52:16,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-01-31 11:52:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:52:16,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:16,384 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:52:16,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 11:52:16,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:16,596 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1227784684, now seen corresponding path program 5 times [2022-01-31 11:52:16,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:16,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393962808] [2022-01-31 11:52:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:16,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:16,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:16,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393962808] [2022-01-31 11:52:16,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393962808] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588220466] [2022-01-31 11:52:16,693 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:52:16,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:16,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:52:16,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 11:52:16,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:52:16,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:52:16,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:52:16,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:16,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:16,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588220466] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:52:16,983 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:52:16,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:52:16,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993512712] [2022-01-31 11:52:16,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:52:16,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:52:16,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:52:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:52:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:52:16,985 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:17,279 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-01-31 11:52:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:52:17,279 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:52:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:17,280 INFO L225 Difference]: With dead ends: 116 [2022-01-31 11:52:17,280 INFO L226 Difference]: Without dead ends: 116 [2022-01-31 11:52:17,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:52:17,281 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 82 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:17,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 115 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:52:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-31 11:52:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2022-01-31 11:52:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 71 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:52:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-01-31 11:52:17,286 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 44 [2022-01-31 11:52:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:17,286 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-01-31 11:52:17,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-01-31 11:52:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:52:17,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:17,287 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:52:17,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:52:17,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:17,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash 135681558, now seen corresponding path program 6 times [2022-01-31 11:52:17,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130111689] [2022-01-31 11:52:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:17,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:17,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:17,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130111689] [2022-01-31 11:52:17,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130111689] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:17,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317809292] [2022-01-31 11:52:17,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:52:17,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:17,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:52:17,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:52:17,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:52:17,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:52:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:52:17,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:17,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:17,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317809292] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:52:17,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:52:17,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:52:17,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845351148] [2022-01-31 11:52:17,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:52:17,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:52:17,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:52:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:52:17,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:52:17,785 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:18,001 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-01-31 11:52:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:52:18,001 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:52:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:18,002 INFO L225 Difference]: With dead ends: 109 [2022-01-31 11:52:18,002 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 11:52:18,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:52:18,003 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:18,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 88 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:52:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 11:52:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2022-01-31 11:52:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.08) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:52:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-01-31 11:52:18,009 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2022-01-31 11:52:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-01-31 11:52:18,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-01-31 11:52:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:52:18,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:18,012 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:52:18,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:52:18,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:18,215 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1757175437, now seen corresponding path program 1 times [2022-01-31 11:52:18,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:18,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015767329] [2022-01-31 11:52:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:18,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 11:52:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:52:19,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:19,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015767329] [2022-01-31 11:52:19,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015767329] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:19,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722342135] [2022-01-31 11:52:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:19,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:19,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:52:19,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:52:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:19,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-31 11:52:19,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:19,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:52:19,186 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:52:19,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-01-31 11:52:19,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:52:19,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:19,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:52:19,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:19,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:52:19,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-01-31 11:52:19,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:19,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-01-31 11:52:19,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:19,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:52:19,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-31 11:52:19,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:19,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2022-01-31 11:52:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:20,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:52:20,092 INFO L353 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-01-31 11:52:20,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 70 [2022-01-31 11:52:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:20,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:52:20,255 INFO L353 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-01-31 11:52:20,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 50 [2022-01-31 11:52:29,132 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-01-31 11:52:29,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 35 [2022-01-31 11:52:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:52:29,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:53:10,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722342135] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:10,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:10,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 27] total 77 [2022-01-31 11:53:10,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911066005] [2022-01-31 11:53:10,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:10,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-31 11:53:10,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:10,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-31 11:53:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5429, Unknown=21, NotChecked=0, Total=5852 [2022-01-31 11:53:10,760 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 77 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 74 states have internal predecessors, (109), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:54:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:54:01,713 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-01-31 11:54:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 11:54:01,714 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 74 states have internal predecessors, (109), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-01-31 11:54:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:54:01,714 INFO L225 Difference]: With dead ends: 97 [2022-01-31 11:54:01,714 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 11:54:01,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3329 ImplicationChecksByTransitivity, 100.0s TimeCoverageRelationStatistics Valid=879, Invalid=10639, Unknown=38, NotChecked=0, Total=11556 [2022-01-31 11:54:01,717 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:54:01,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 460 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 943 Invalid, 0 Unknown, 459 Unchecked, 1.4s Time] [2022-01-31 11:54:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 11:54:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-01-31 11:54:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:54:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 11:54:01,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2022-01-31 11:54:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:54:01,721 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 11:54:01,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 74 states have internal predecessors, (109), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:54:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 11:54:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:54:01,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:54:01,721 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:54:01,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:54:01,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:54:01,922 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:54:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:54:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1605127086, now seen corresponding path program 7 times [2022-01-31 11:54:01,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:54:01,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879759021] [2022-01-31 11:54:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:54:01,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:54:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:54:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:54:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:54:04,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:54:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879759021] [2022-01-31 11:54:04,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879759021] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:54:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456557938] [2022-01-31 11:54:04,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:54:04,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:54:04,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:54:04,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:54:04,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 11:54:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:04,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-31 11:54:04,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:54:04,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:54:04,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:54:04,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:54:04,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:04,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:54:04,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:04,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:04,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:04,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 11:54:05,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2022-01-31 11:54:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 57 [2022-01-31 11:54:05,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:05,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:05,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-01-31 11:54:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:06,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2022-01-31 11:54:06,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:06,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2022-01-31 11:54:06,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:06,811 INFO L353 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-01-31 11:54:06,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-01-31 11:54:07,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:07,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:54:07,141 INFO L353 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-01-31 11:54:07,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2022-01-31 11:54:07,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:07,652 INFO L353 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-01-31 11:54:07,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-01-31 11:54:08,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:08,235 INFO L353 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-01-31 11:54:08,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-01-31 11:54:09,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:54:09,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-01-31 11:54:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:54:09,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:54:11,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_141 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_141)) (forall ((v_ArrVal_517 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset))))) is different from false [2022-01-31 11:54:51,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_142 Int)) (or (forall ((v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_142)))) is different from false [2022-01-31 11:54:53,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_142 Int) (main_~b~0.base Int) (v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_142)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)) (= (select (store (store (let ((.cse0 (* c_main_~i~0 8))) (store (select |c_#memory_int| main_~b~0.base) (+ .cse0 c_main_~b~0.offset) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse0)) 1))) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset) (+ c_~N~0 2)))) is different from false [2022-01-31 11:55:01,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_145 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)) (forall ((v_ArrVal_511 Int) (v_main_~i~0_142 Int) (main_~b~0.base Int) (v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (not (<= 1 v_main_~i~0_142)) (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_511))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse0) main_~b~0.base) c_main_~b~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset) (+ c_~N~0 2)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))))) is different from false [2022-01-31 11:57:10,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_main_~i~0_145 Int) (v_main_~i~0_142 Int) (main_~b~0.base Int) (v_ArrVal_509 Int) (v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (= (select (store (store (let ((.cse0 (store (let ((.cse3 (* c_main_~i~0 8))) (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset .cse3))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse1 .cse2)))) (+ c_main_~a~0.offset .cse3 8) v_ArrVal_509)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_511))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse0) main_~b~0.base) c_main_~b~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset) (+ c_~N~0 2)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_145)) (not (<= 1 v_main_~i~0_142)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))) is different from false [2022-01-31 11:57:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-01-31 11:57:39,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456557938] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:57:39,339 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:57:39,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 32] total 84 [2022-01-31 11:57:39,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433494778] [2022-01-31 11:57:39,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:57:39,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-31 11:57:39,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:57:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-31 11:57:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=5614, Unknown=129, NotChecked=790, Total=6972 [2022-01-31 11:57:39,341 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 84 states, 82 states have (on average 1.329268292682927) internal successors, (109), 81 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:45,711 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))))) (and (= .cse0 1) (= (select .cse1 c_main_~a~0.offset) (+ 3 .cse0)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_145 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)) (forall ((v_ArrVal_511 Int) (v_main_~i~0_142 Int) (main_~b~0.base Int) (v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (not (<= 1 v_main_~i~0_142)) (= (select (store (store (let ((.cse2 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_511))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse2) main_~b~0.base) c_main_~b~0.offset (+ (select .cse2 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset) (+ c_~N~0 2)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))))) (<= (+ 3 (div (* (- 1) c_main_~a~0.offset) 8)) c_~N~0) (<= 3 c_~N~0) (= c_main_~b~0.offset 0) (or (let ((.cse4 (select .cse1 0)) (.cse3 (+ c_~N~0 1))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (and (<= c_main_~i~0 1) (<= (+ c_main_~i~0 3) c_~N~0))) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ 2 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))))) (not (= c_main_~a~0.base |main_~#sum~0.base|)))) (= c_main_~i~0 1)))) is different from false [2022-01-31 11:57:47,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_145 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)) (forall ((v_ArrVal_511 Int) (v_main_~i~0_142 Int) (main_~b~0.base Int) (v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (not (<= 1 v_main_~i~0_142)) (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_511))) (store (select (store |c_#memory_int| c_main_~a~0.base .cse0) main_~b~0.base) c_main_~b~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset) (+ c_~N~0 2)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))))) (<= (+ 3 (div (* (- 1) c_main_~a~0.offset) 8)) c_~N~0) (<= 3 c_~N~0) (= c_main_~b~0.offset 0) (= (select .cse1 c_main_~a~0.offset) 4) (or (let ((.cse3 (select .cse1 0)) (.cse2 (+ c_~N~0 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (and (<= c_main_~i~0 1) (<= (+ c_main_~i~0 3) c_~N~0))) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3))))) is different from false [2022-01-31 11:58:02,717 WARN L228 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 58 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:58:12,628 WARN L228 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:58:24,236 WARN L228 SmtUtils]: Spent 11.47s on a formula simplification. DAG size of input: 61 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:58:26,239 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 8) c_main_~b~0.offset)))) (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (+ c_~N~0 2) .cse0) (exists ((|main_~#sum~0.base| Int) (main_~a~0.base Int)) (and (or (= (select (select |c_#memory_int| main_~a~0.base) (* c_main_~i~0 8)) 4) (= c_main_~b~0.base main_~a~0.base)) (or (= c_main_~b~0.base |main_~#sum~0.base|) (exists ((|main_~#sum~0.offset| Int)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (forall ((v_main_~i~0_142 Int)) (or (forall ((v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_142)))) (= c_main_~b~0.offset 0) (<= c_~N~0 3) (= 5 .cse0))) is different from false [2022-01-31 11:58:28,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base))) (and (forall ((v_main_~i~0_141 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_141)) (forall ((v_ArrVal_517 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset))))) (<= 1 c_main_~i~0) (<= (+ (div (* (- 1) c_main_~b~0.offset) 8) 1) c_main_~i~0) (exists ((|main_~#sum~0.base| Int) (main_~a~0.base Int)) (and (or (= c_main_~b~0.base |main_~#sum~0.base|) (exists ((|main_~#sum~0.offset| Int)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3))) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= (select (select |c_#memory_int| main_~a~0.base) 0) 4) (= c_main_~b~0.base main_~a~0.base)))) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= c_main_~b~0.offset 0) (<= c_~N~0 3) (= (+ c_~N~0 2) (select .cse0 0)) (= 5 (select .cse0 c_main_~b~0.offset)))) is different from false [2022-01-31 11:58:30,394 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= (+ c_~N~0 2) (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 8) c_main_~b~0.offset))) (forall ((v_main_~i~0_142 Int)) (or (forall ((v_main_~i~0_141 Int) (v_ArrVal_517 Int) (v_ArrVal_515 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_142) c_main_~b~0.offset) v_ArrVal_515) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset)) (not (<= (+ v_main_~i~0_142 1) v_main_~i~0_141)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_142)))) (= c_main_~b~0.offset 0)) is different from false [2022-01-31 11:58:34,506 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_141 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_141)) (forall ((v_ArrVal_517 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 8 v_main_~i~0_141) c_main_~b~0.offset) v_ArrVal_517) c_main_~b~0.offset))))) (<= (+ (div (* (- 1) c_main_~b~0.offset) 8) 1) c_main_~i~0) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (= (+ c_~N~0 2) (select (select |c_#memory_int| c_main_~b~0.base) 0))) is different from false [2022-01-31 11:58:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:34,860 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-01-31 11:58:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 11:58:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 82 states have (on average 1.329268292682927) internal successors, (109), 81 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:58:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:34,861 INFO L225 Difference]: With dead ends: 107 [2022-01-31 11:58:34,862 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 11:58:34,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 3005 ImplicationChecksByTransitivity, 263.3s TimeCoverageRelationStatistics Valid=632, Invalid=8201, Unknown=141, NotChecked=2156, Total=11130 [2022-01-31 11:58:34,864 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 940 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:34,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 348 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 539 Invalid, 0 Unknown, 940 Unchecked, 0.5s Time] [2022-01-31 11:58:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 11:58:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-01-31 11:58:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 91 states have internal predecessors, (102), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:58:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-01-31 11:58:34,868 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 50 [2022-01-31 11:58:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:34,868 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-01-31 11:58:34,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 82 states have (on average 1.329268292682927) internal successors, (109), 81 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:58:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-01-31 11:58:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 11:58:34,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:34,869 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:58:34,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:58:35,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 11:58:35,079 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2030322838, now seen corresponding path program 8 times [2022-01-31 11:58:35,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571226212] [2022-01-31 11:58:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:35,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:58:35,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571226212] [2022-01-31 11:58:35,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571226212] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111921521] [2022-01-31 11:58:35,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:58:35,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:35,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:35,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 11:58:35,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:58:35,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:35,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:58:35,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:58:35,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:58:35,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111921521] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:35,549 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:35,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:58:35,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296225902] [2022-01-31 11:58:35,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:35,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:58:35,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:58:35,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:58:35,551 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:58:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:36,202 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2022-01-31 11:58:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:58:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-01-31 11:58:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:36,204 INFO L225 Difference]: With dead ends: 151 [2022-01-31 11:58:36,204 INFO L226 Difference]: Without dead ends: 151 [2022-01-31 11:58:36,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:58:36,205 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:36,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 151 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 11:58:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-31 11:58:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2022-01-31 11:58:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 85 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:58:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-01-31 11:58:36,208 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 52 [2022-01-31 11:58:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:36,208 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-01-31 11:58:36,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:58:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-01-31 11:58:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:58:36,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:36,209 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:58:36,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 11:58:36,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:36,423 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1288495798, now seen corresponding path program 9 times [2022-01-31 11:58:36,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:36,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682680878] [2022-01-31 11:58:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:36,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:58:36,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:36,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682680878] [2022-01-31 11:58:36,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682680878] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:36,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780574899] [2022-01-31 11:58:36,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:58:36,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:36,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:36,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 11:58:36,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:58:36,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:36,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:58:36,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:58:36,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:58:36,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780574899] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:36,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:36,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:58:36,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831066816] [2022-01-31 11:58:36,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:36,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:58:36,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:58:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:58:36,935 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:58:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:37,270 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2022-01-31 11:58:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:58:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-01-31 11:58:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:37,272 INFO L225 Difference]: With dead ends: 131 [2022-01-31 11:58:37,272 INFO L226 Difference]: Without dead ends: 128 [2022-01-31 11:58:37,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:58:37,272 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 132 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:37,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 90 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:58:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-31 11:58:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2022-01-31 11:58:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:58:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2022-01-31 11:58:37,276 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 54 [2022-01-31 11:58:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:37,276 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2022-01-31 11:58:37,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:58:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2022-01-31 11:58:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:58:37,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:37,277 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:58:37,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:58:37,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 11:58:37,492 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1124834845, now seen corresponding path program 2 times [2022-01-31 11:58:37,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:37,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950778822] [2022-01-31 11:58:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:37,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 11:58:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:58:39,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:39,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950778822] [2022-01-31 11:58:39,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950778822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:39,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426521502] [2022-01-31 11:58:39,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:58:39,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:39,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:39,727 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:39,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 11:58:39,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:58:39,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:39,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-31 11:58:39,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:39,827 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:58:39,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2022-01-31 11:58:39,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:58:40,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:58:40,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 11:58:40,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 11:58:40,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 11:58:40,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:58:40,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:40,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-01-31 11:58:40,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:40,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2022-01-31 11:58:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:40,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-01-31 11:58:41,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:41,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2022-01-31 11:58:41,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:41,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:41,452 INFO L353 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2022-01-31 11:58:41,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 59 [2022-01-31 11:58:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:41,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:41,747 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 11:58:41,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 71 [2022-01-31 11:59:02,524 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-01-31 11:59:02,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 31 [2022-01-31 11:59:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:59:02,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:59:32,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_main_~i~0_215 Int)) (or (let ((.cse0 (store (let ((.cse1 (* c_main_~i~0 8))) (store (select |c_#memory_int| c_main_~b~0.base) (+ .cse1 c_main_~b~0.offset) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1)) 1))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 c_main_~b~0.offset) (select .cse0 (+ 8 c_main_~b~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_215)))) is different from false [2022-01-31 11:59:33,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_main_~i~0_215 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_215)) (let ((.cse0 (store (let ((.cse1 (* c_main_~i~0 8))) (store (select |c_#memory_int| c_main_~b~0.base) (+ .cse1 8 c_main_~b~0.offset) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 8)) 1))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 (+ 8 c_main_~b~0.offset)) (select .cse0 c_main_~b~0.offset))))) is different from false [2022-01-31 11:59:35,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_main_~i~0_215 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_215)) (let ((.cse0 (store (let ((.cse2 (* c_main_~i~0 8))) (let ((.cse1 (store (select |c_#memory_int| c_main_~b~0.base) (+ .cse2 c_main_~b~0.offset) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse2)) 1)))) (store .cse1 (+ .cse2 8 c_main_~b~0.offset) (+ (select (select (store |c_#memory_int| c_main_~b~0.base .cse1) c_main_~a~0.base) (+ c_main_~a~0.offset .cse2 8)) 1)))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 c_main_~b~0.offset) (select .cse0 (+ 8 c_main_~b~0.offset)))))) is different from false [2022-01-31 12:00:14,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_215 Int)) (or (not (<= 2 v_main_~i~0_215)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse5 .cse6 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse5 .cse6)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse4 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 c_main_~b~0.offset) (select .cse0 .cse1)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_219)))) is different from false [2022-01-31 12:00:16,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_215 Int)) (or (not (<= 2 v_main_~i~0_215)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_219)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (+ c_main_~a~0.offset (* c_main_~i~0 8) 8))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse4 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 .cse1) (select .cse0 c_main_~b~0.offset)))))) is different from false [2022-01-31 12:01:48,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:01:48,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1145 treesize of output 924 [2022-01-31 12:01:48,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_215 Int)) (or (not (<= 2 v_main_~i~0_219)) (not (<= 2 v_main_~i~0_215)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ (select .cse8 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store .cse6 c_main_~a~0.base .cse5))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse5 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) .cse4) 1)))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 .cse1) (select .cse0 c_main_~b~0.offset)))))) is different from false [2022-01-31 12:01:49,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_215 Int)) (or (not (<= 2 v_main_~i~0_219)) (not (<= 2 v_main_~i~0_215)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse6 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_749)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ (select .cse8 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store .cse6 c_main_~a~0.base .cse5))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse5 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) .cse4) 1)))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 c_main_~b~0.offset) (select .cse0 .cse1)))))) is different from false [2022-01-31 12:01:49,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_227 Int)) (or (forall ((v_ArrVal_764 Int) (|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_215 Int)) (or (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse6 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_227) c_main_~a~0.offset) v_ArrVal_749)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ (select .cse8 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse7 .cse4 (+ (select (select (store .cse6 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse7 .cse4)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store .cse6 c_main_~a~0.base .cse5))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse5 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) .cse4) 1)))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 .cse1) (select .cse0 c_main_~b~0.offset)))) (not (<= 2 v_main_~i~0_219)) (not (<= 2 v_main_~i~0_215)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_227)))) is different from false [2022-01-31 12:01:49,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_227 Int) (v_main_~i~0_215 Int)) (or (not (<= 2 v_main_~i~0_219)) (not (<= 2 v_main_~i~0_215)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_227)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse6 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) 1) (+ (* 8 v_main_~i~0_227) c_main_~a~0.offset) v_ArrVal_749)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ (select v_arrayElimArr_1 |main_~#sum~0.offset|) (select .cse8 c_main_~a~0.offset)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store .cse6 c_main_~a~0.base .cse5))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse5 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) .cse4) 1)))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 .cse1) (select .cse0 c_main_~b~0.offset)))))) is different from false [2022-01-31 12:01:50,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_main_~i~0_219 Int) (v_main_~i~0_227 Int) (v_main_~i~0_215 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_227)) (not (<= 2 v_main_~i~0_219)) (not (<= 2 v_main_~i~0_215)) (let ((.cse1 (+ 8 c_main_~b~0.offset))) (let ((.cse0 (store (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse6 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1) (+ (* 8 v_main_~i~0_227) c_main_~a~0.offset) v_ArrVal_749)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ (select .cse8 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse7 .cse4 (+ (select (select (store .cse6 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse7 .cse4)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_219)) v_ArrVal_759))) (let ((.cse3 (store .cse6 c_main_~a~0.base .cse5))) (let ((.cse2 (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset (+ (select .cse5 c_main_~a~0.offset) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~b~0.base .cse2) c_main_~a~0.base) .cse4) 1)))))) (+ (* 8 v_main_~i~0_215) c_main_~b~0.offset) v_ArrVal_764))) (= (select .cse0 .cse1) (select .cse0 c_main_~b~0.offset)))))) is different from false [2022-01-31 12:01:50,297 INFO L353 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2022-01-31 12:01:50,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 3029 treesize of output 1015 [2022-01-31 12:01:50,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:01:50,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13543 treesize of output 12607 [2022-01-31 12:01:50,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:50,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:50,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:50,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:50,483 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:01:50,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17467 treesize of output 14835