./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:19:36,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:19:36,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:19:36,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:19:36,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:19:36,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:19:36,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:19:36,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:19:36,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:19:36,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:19:36,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:19:36,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:19:36,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:19:36,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:19:36,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:19:36,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:19:36,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:19:36,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:19:36,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:19:36,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:19:36,491 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:19:36,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:19:36,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:19:36,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:19:36,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:19:36,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:19:36,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:19:36,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:19:36,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:19:36,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:19:36,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:19:36,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:19:36,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:19:36,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:19:36,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:19:36,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:19:36,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:19:36,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:19:36,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:19:36,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:19:36,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:19:36,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:19:36,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:19:36,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:19:36,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:19:36,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:19:36,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:19:36,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:19:36,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:19:36,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:19:36,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:19:36,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:19:36,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:19:36,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:19:36,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:19:36,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:19:36,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:19:36,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:19:36,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:19:36,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:19:36,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:19:36,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:19:36,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:19:36,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:19:36,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:19:36,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:19:36,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:19:36,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:19:36,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:19:36,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:19:36,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:19:36,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 [2022-07-13 11:19:36,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:19:36,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:19:36,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:19:36,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:19:36,741 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:19:36,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina5.c [2022-07-13 11:19:36,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97494c1b6/77e63fdb60b14b7b9a96ae98b3731faf/FLAG2fcdec1f9 [2022-07-13 11:19:37,122 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:19:37,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c [2022-07-13 11:19:37,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97494c1b6/77e63fdb60b14b7b9a96ae98b3731faf/FLAG2fcdec1f9 [2022-07-13 11:19:37,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97494c1b6/77e63fdb60b14b7b9a96ae98b3731faf [2022-07-13 11:19:37,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:19:37,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:19:37,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:19:37,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:19:37,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:19:37,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528ba57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37, skipping insertion in model container [2022-07-13 11:19:37,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:19:37,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:19:37,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2022-07-13 11:19:37,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:19:37,358 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:19:37,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2022-07-13 11:19:37,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:19:37,381 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:19:37,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37 WrapperNode [2022-07-13 11:19:37,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:19:37,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:19:37,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:19:37,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:19:37,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,410 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2022-07-13 11:19:37,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:19:37,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:19:37,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:19:37,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:19:37,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:19:37,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:19:37,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:19:37,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:19:37,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (1/1) ... [2022-07-13 11:19:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:19:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:37,483 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-07-13 11:19:37,499 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-07-13 11:19:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:19:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:19:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:19:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:19:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:19:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:19:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:19:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:19:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:19:37,569 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:19:37,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:19:37,686 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:19:37,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:19:37,699 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-13 11:19:37,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:19:37 BoogieIcfgContainer [2022-07-13 11:19:37,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:19:37,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:19:37,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:19:37,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:19:37,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:19:37" (1/3) ... [2022-07-13 11:19:37,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1662854a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:19:37, skipping insertion in model container [2022-07-13 11:19:37,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:19:37" (2/3) ... [2022-07-13 11:19:37,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1662854a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:19:37, skipping insertion in model container [2022-07-13 11:19:37,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:19:37" (3/3) ... [2022-07-13 11:19:37,711 INFO L111 eAbstractionObserver]: Analyzing ICFG sina5.c [2022-07-13 11:19:37,720 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:19:37,721 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:19:37,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:19:37,761 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@554b184a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@329a8a40 [2022-07-13 11:19:37,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:19:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:19:37,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:37,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:37,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2022-07-13 11:19:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:37,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262428295] [2022-07-13 11:19:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262428295] [2022-07-13 11:19:37,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262428295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:19:37,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:19:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:19:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356205588] [2022-07-13 11:19:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:19:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:19:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:19:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:19:37,892 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:37,905 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2022-07-13 11:19:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:19:37,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:19:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:37,912 INFO L225 Difference]: With dead ends: 56 [2022-07-13 11:19:37,913 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 11:19:37,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:19:37,926 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:37,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:19:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 11:19:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 11:19:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-13 11:19:37,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-07-13 11:19:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:37,954 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-13 11:19:37,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-13 11:19:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:19:37,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:37,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:37,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:19:37,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2022-07-13 11:19:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:37,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041831373] [2022-07-13 11:19:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:38,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041831373] [2022-07-13 11:19:38,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041831373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:19:38,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:19:38,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:19:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385552887] [2022-07-13 11:19:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:19:38,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:19:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:19:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:19:38,063 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:38,122 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-07-13 11:19:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:19:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:19:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:38,123 INFO L225 Difference]: With dead ends: 61 [2022-07-13 11:19:38,123 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:19:38,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:19:38,125 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:38,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 18 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:19:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:19:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-13 11:19:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 11:19:38,130 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-07-13 11:19:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:38,130 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 11:19:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 11:19:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:19:38,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:38,132 INFO L195 NwaCegarLoop]: 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] [2022-07-13 11:19:38,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:19:38,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:38,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2022-07-13 11:19:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:38,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904460113] [2022-07-13 11:19:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:39,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904460113] [2022-07-13 11:19:39,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904460113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792127486] [2022-07-13 11:19:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:39,022 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-07-13 11:19:39,024 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-07-13 11:19:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 11:19:39,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:39,185 INFO L390 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-07-13 11:19:39,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:39,208 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:19:39,211 INFO L390 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 28 treesize of output 24 [2022-07-13 11:19:39,261 INFO L390 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-07-13 11:19:39,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:39,452 INFO L390 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 26 treesize of output 28 [2022-07-13 11:19:39,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:39,577 INFO L390 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 43 treesize of output 33 [2022-07-13 11:19:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:39,711 INFO L390 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 51 treesize of output 37 [2022-07-13 11:19:39,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:39,851 INFO L390 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 45 treesize of output 35 [2022-07-13 11:19:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:40,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:40,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:40,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:40,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792127486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:40,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2022-07-13 11:19:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674951230] [2022-07-13 11:19:40,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:40,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 11:19:40,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 11:19:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 11:19:40,577 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:41,074 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-13 11:19:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:19:41,075 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:19:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:41,076 INFO L225 Difference]: With dead ends: 64 [2022-07-13 11:19:41,076 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 11:19:41,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 11:19:41,077 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:41,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 411 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-07-13 11:19:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 11:19:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-13 11:19:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-13 11:19:41,084 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2022-07-13 11:19:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:41,085 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-13 11:19:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-13 11:19:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:19:41,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:41,089 INFO L195 NwaCegarLoop]: 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] [2022-07-13 11:19:41,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:19:41,305 WARN L477 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-07-13 11:19:41,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2022-07-13 11:19:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:41,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122321770] [2022-07-13 11:19:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:41,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122321770] [2022-07-13 11:19:41,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122321770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:41,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683466535] [2022-07-13 11:19:41,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:19:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:41,353 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-07-13 11:19:41,354 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-07-13 11:19:41,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:19:41,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:19:41,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683466535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:41,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:41,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:19:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400919941] [2022-07-13 11:19:41,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:41,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:19:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:19:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:19:41,464 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:41,583 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2022-07-13 11:19:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:19:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 11:19:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:41,585 INFO L225 Difference]: With dead ends: 134 [2022-07-13 11:19:41,585 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:19:41,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:19:41,586 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:41,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 60 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:19:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:19:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-07-13 11:19:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-07-13 11:19:41,593 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2022-07-13 11:19:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:41,593 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-07-13 11:19:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-07-13 11:19:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:19:41,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:41,594 INFO L195 NwaCegarLoop]: 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] [2022-07-13 11:19:41,612 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-07-13 11:19:41,807 WARN L477 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-07-13 11:19:41,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2022-07-13 11:19:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:41,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424807450] [2022-07-13 11:19:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424807450] [2022-07-13 11:19:41,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424807450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920620722] [2022-07-13 11:19:41,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:19:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:41,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:41,848 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-07-13 11:19:41,849 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-07-13 11:19:41,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:19:41,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:41,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:19:41,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:19:41,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920620722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:41,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:41,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:19:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700104871] [2022-07-13 11:19:41,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:41,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:19:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:19:41,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:19:41,965 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:42,099 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-07-13 11:19:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:19:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 11:19:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:42,099 INFO L225 Difference]: With dead ends: 74 [2022-07-13 11:19:42,100 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 11:19:42,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:19:42,100 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:42,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 47 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:19:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 11:19:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2022-07-13 11:19:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-13 11:19:42,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2022-07-13 11:19:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:42,104 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-13 11:19:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-13 11:19:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:19:42,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:42,105 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:19:42,135 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-07-13 11:19:42,306 WARN L477 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-07-13 11:19:42,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2022-07-13 11:19:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529980082] [2022-07-13 11:19:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529980082] [2022-07-13 11:19:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529980082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655174374] [2022-07-13 11:19:43,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:19:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:43,772 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-07-13 11:19:43,774 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-07-13 11:19:43,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:19:43,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:43,838 WARN L261 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-13 11:19:43,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:43,886 INFO L390 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 18 treesize of output 16 [2022-07-13 11:19:43,895 INFO L390 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-07-13 11:19:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:43,941 INFO L390 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-07-13 11:19:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,061 INFO L390 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 30 treesize of output 32 [2022-07-13 11:19:44,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,318 INFO L390 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 39 treesize of output 44 [2022-07-13 11:19:44,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-07-13 11:19:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:44,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-07-13 11:19:44,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:44,849 INFO L390 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 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-13 11:19:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:45,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2022-07-13 11:19:45,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,217 INFO L390 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 0 case distinctions, treesize of input 67 treesize of output 59 [2022-07-13 11:19:45,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:45,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2022-07-13 11:19:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:19:45,641 INFO L356 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-07-13 11:19:45,642 INFO L390 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 78 [2022-07-13 11:19:45,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:45,875 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 11:19:45,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 47 [2022-07-13 11:19:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:45,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:48,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_81|)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* c_~N~0 2) 1))))) is different from false [2022-07-13 11:20:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 11:20:11,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655174374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:11,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:20:11,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 77 [2022-07-13 11:20:11,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970228064] [2022-07-13 11:20:11,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:11,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-13 11:20:11,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-13 11:20:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=5214, Unknown=31, NotChecked=148, Total=5852 [2022-07-13 11:20:11,292 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:14,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (* c_~N~0 2) 1)) (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (+ .cse3 (- 3)))) (and (= .cse1 1) (= (select .cse2 0) 1) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse2 8) .cse1) (= (+ (* (- 1) .cse3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1))))) (< 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_81|)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* c_~N~0 2) 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:20:16,914 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~N~0 2) (not (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 7)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) (+ (* c_~N~0 2) 1)) (< 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_81|)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* c_~N~0 2) 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (+ .cse2 (- 3)))) (and (= .cse0 1) (= (select .cse1 0) 1) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (+ .cse2 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse1 8) .cse0)))))) is different from false [2022-07-13 11:20:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:19,122 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-07-13 11:20:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 11:20:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 11:20:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:19,123 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:20:19,123 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 11:20:19,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=599, Invalid=6689, Unknown=34, NotChecked=510, Total=7832 [2022-07-13 11:20:19,125 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:19,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 241 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 454 Invalid, 0 Unknown, 728 Unchecked, 0.3s Time] [2022-07-13 11:20:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 11:20:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-07-13 11:20:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-13 11:20:19,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 38 [2022-07-13 11:20:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:19,133 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-13 11:20:19,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-13 11:20:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:20:19,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:19,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-13 11:20:19,150 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-07-13 11:20:19,340 WARN L477 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-07-13 11:20:19,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1666934362, now seen corresponding path program 5 times [2022-07-13 11:20:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309676904] [2022-07-13 11:20:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:20:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309676904] [2022-07-13 11:20:19,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309676904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:20:19,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976135679] [2022-07-13 11:20:19,410 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:20:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:19,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:19,411 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-07-13 11:20:19,412 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-07-13 11:20:19,514 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:20:19,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:20:19,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:20:19,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:20:19,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:20:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976135679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:19,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:20:19,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-13 11:20:19,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85781826] [2022-07-13 11:20:19,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:19,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:20:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:20:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:20:19,619 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:19,994 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2022-07-13 11:20:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:20:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-13 11:20:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:19,995 INFO L225 Difference]: With dead ends: 160 [2022-07-13 11:20:19,995 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 11:20:19,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 11:20:19,996 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 309 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:19,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 171 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:20:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 11:20:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2022-07-13 11:20:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-13 11:20:20,004 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 40 [2022-07-13 11:20:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:20,004 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-13 11:20:20,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-13 11:20:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 11:20:20,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:20,005 INFO L195 NwaCegarLoop]: 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] [2022-07-13 11:20:20,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 11:20:20,222 WARN L477 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-07-13 11:20:20,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -465930606, now seen corresponding path program 1 times [2022-07-13 11:20:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:20,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595428577] [2022-07-13 11:20:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:21,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595428577] [2022-07-13 11:20:21,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595428577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:20:21,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679391230] [2022-07-13 11:20:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:21,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:21,759 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-07-13 11:20:21,760 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-07-13 11:20:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:21,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 11:20:21,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:21,834 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:20:21,834 INFO L390 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-07-13 11:20:21,880 INFO L390 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-07-13 11:20:21,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:21,957 INFO L390 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 21 treesize of output 20 [2022-07-13 11:20:22,023 INFO L390 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 23 [2022-07-13 11:20:22,048 INFO L390 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 23 [2022-07-13 11:20:22,160 INFO L390 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 23 [2022-07-13 11:20:22,173 INFO L390 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 23 [2022-07-13 11:20:22,192 INFO L390 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 23 [2022-07-13 11:20:22,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:22,205 INFO L390 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 28 treesize of output 30 [2022-07-13 11:20:22,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:22,228 INFO L390 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 46 treesize of output 36 [2022-07-13 11:20:22,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:22,322 INFO L390 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 48 treesize of output 34 [2022-07-13 11:20:22,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 72 treesize of output 44 [2022-07-13 11:20:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:20:22,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:30,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:20:30,769 INFO L390 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 96 treesize of output 84 [2022-07-13 11:20:32,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse0) (* (- 1) .cse1) 1) (- 2))) 1) (+ (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse0 .cse1 1) 2) 0))))))) is different from false [2022-07-13 11:20:33,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse0 .cse1 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse0) (* (- 1) .cse1) 1) (- 2))) 1) (+ (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) is different from false [2022-07-13 11:20:33,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse0 .cse1 1) 2) 0)) (= (+ (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (+ (* 2 (div (+ (* (- 1) .cse0) (* (- 1) .cse1) 1) (- 2))) 1))))))) is different from false [2022-07-13 11:20:35,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse0 .cse1 1) 2) 0)) (= (+ (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (+ (* 2 (div (+ (* (- 1) .cse0) (* (- 1) .cse1) 1) (- 2))) 1))))))) is different from false [2022-07-13 11:20:35,316 INFO L356 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-07-13 11:20:35,317 INFO L390 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 2 case distinctions, treesize of input 222 treesize of output 127 [2022-07-13 11:20:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 451 treesize of output 433 [2022-07-13 11:20:35,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:35,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:20:35,406 INFO L390 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 279 treesize of output 273 [2022-07-13 11:20:35,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:35,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:20:35,477 INFO L390 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 484 treesize of output 408 [2022-07-13 11:20:35,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:20:35,858 INFO L356 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-07-13 11:20:35,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 277 treesize of output 325 [2022-07-13 11:20:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-07-13 11:20:36,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679391230] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:36,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:20:36,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 16, 18] total 60 [2022-07-13 11:20:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238955205] [2022-07-13 11:20:36,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:36,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-13 11:20:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-13 11:20:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2724, Unknown=8, NotChecked=444, Total=3540 [2022-07-13 11:20:36,812 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 60 states, 60 states have (on average 1.85) internal successors, (111), 60 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:42,672 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse5 .cse6 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse5) (* (- 1) .cse6) 1) (- 2))) 1) (+ (select .cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) is different from false [2022-07-13 11:20:44,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (not (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|) 0)) (<= c_~N~0 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse5 .cse6 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse5) (* (- 1) .cse6) 1) (- 2))) 1) (+ (select .cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:20:49,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (let ((.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (not (= .cse6 8)) (= (select .cse1 .cse6) 1))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse7 .cse8 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse7) (* (- 1) .cse8) 1) (- 2))) 1) (+ (select .cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:20:51,697 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse5 .cse6 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse5) (* (- 1) .cse6) 1) (- 2))) 1) (+ (select .cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) is different from false [2022-07-13 11:20:53,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse6 .cse7 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse6) (* (- 1) .cse7) 1) (- 2))) 1) (+ (select .cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (or (= (select .cse1 8) 1) (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 1 |c_ULTIMATE.start_main_~b~0#1.offset|) (* c_~N~0 8))))) is different from false [2022-07-13 11:20:55,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (mod (+ .cse5 .cse6 1) 2) 0)) (= (+ (* 2 (div (+ (* (- 1) .cse5) (* (- 1) .cse6) 1) (- 2))) 1) (+ (select .cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) is different from false [2022-07-13 11:20:57,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 8) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse1 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:21:00,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 8) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse1 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:21:02,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (select .cse0 0) 1) (<= c_~N~0 2) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 8) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse2 .cse3) (= (select .cse1 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse4) (* (- 1) .cse5) 1) (- 2))) 1) (+ (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse4 .cse5 1) 2) 0))))))) (<= .cse3 .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2022-07-13 11:21:04,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 8) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (let ((.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse6 8)) (let ((.cse7 (select .cse0 0)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select .cse0 .cse6) 1) (= .cse7 1) (<= c_~N~0 2) (<= .cse8 .cse7) (= (select .cse1 0) 1) (<= .cse7 .cse8))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:21:06,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (= .cse7 8))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse1 (and (<= 2 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse2 8) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse3) (* (- 1) .cse4) 1) (- 2))) 1) (+ (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse3 .cse4 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (let ((.cse9 (* c_~N~0 2)) (.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2))) (and (= (select .cse0 .cse7) 1) (= (select .cse0 0) 1) (<= .cse8 .cse9) (= (select .cse2 0) 1) (<= .cse9 .cse8))) (not .cse1))))) is different from false [2022-07-13 11:21:08,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:21:10,426 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 8) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse2) (* (- 1) .cse3) 1) (- 2))) 1) (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse2 .cse3 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (let ((.cse7 (* c_~N~0 2)) (.cse6 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2))) (and (= (select .cse0 0) 1) (<= .cse6 .cse7) (= (select .cse0 8) 1) (= (select .cse1 0) 1) (<= .cse7 .cse6)))))) is different from false [2022-07-13 11:21:12,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse1) (* (- 1) .cse2) 1) (- 2))) 1) (+ (select .cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse1 .cse2 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:21:14,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (* c_~N~0 2)) (.cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2))) (and (= (select .cse0 0) 1) (<= .cse1 .cse2) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse3 8) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse3 0) 1) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse4) (* (- 1) .cse5) 1) (- 2))) 1) (+ (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse4 .cse5 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 .cse1))) is different from false [2022-07-13 11:21:16,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (* c_~N~0 2)) (.cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2))) (and (= (select .cse0 0) 1) (<= .cse1 .cse2) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse3 8) 1) (= (select .cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (+ (* 2 (div (+ (* (- 1) .cse4) (* (- 1) .cse5) 1) (- 2))) 1) (+ (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (mod (+ .cse4 .cse5 1) 2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 .cse1))) is different from false [2022-07-13 11:21:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:19,487 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2022-07-13 11:21:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 11:21:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.85) internal successors, (111), 60 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-13 11:21:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:19,488 INFO L225 Difference]: With dead ends: 130 [2022-07-13 11:21:19,488 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 11:21:19,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=567, Invalid=4179, Unknown=26, NotChecked=3060, Total=7832 [2022-07-13 11:21:19,490 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:19,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 529 Invalid, 0 Unknown, 199 Unchecked, 1.7s Time] [2022-07-13 11:21:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 11:21:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-13 11:21:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 93 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-07-13 11:21:19,502 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 42 [2022-07-13 11:21:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:19,503 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-07-13 11:21:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.85) internal successors, (111), 60 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-07-13 11:21:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:21:19,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:19,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-13 11:21:19,520 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-07-13 11:21:19,707 WARN L477 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-07-13 11:21:19,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash 383514002, now seen corresponding path program 6 times [2022-07-13 11:21:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:19,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069040174] [2022-07-13 11:21:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:19,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:28,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069040174] [2022-07-13 11:21:28,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069040174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:21:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110780110] [2022-07-13 11:21:28,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:21:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:28,745 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-07-13 11:21:28,745 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-07-13 11:21:28,844 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:21:28,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:28,846 WARN L261 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-13 11:21:28,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:28,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:28,893 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:21:28,893 INFO L390 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 28 treesize of output 24 [2022-07-13 11:21:28,937 INFO L390 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-07-13 11:21:29,151 INFO L390 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-07-13 11:21:29,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:29,727 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:21:29,727 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 11:21:30,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:30,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:30,286 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:21:30,286 INFO L390 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 2 case distinctions, treesize of input 42 treesize of output 47 [2022-07-13 11:21:31,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:31,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:31,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:31,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:31,617 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:21:31,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2022-07-13 11:21:32,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,100 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 11:21:32,101 INFO L390 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 55 treesize of output 66 [2022-07-13 11:21:32,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:32,872 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-07-13 11:21:32,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 81 [2022-07-13 11:21:34,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:34,758 INFO L356 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2022-07-13 11:21:34,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 94 [2022-07-13 11:21:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:35,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:35,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2022-07-13 11:21:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:36,715 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-13 11:21:36,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 88 [2022-07-13 11:21:37,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:37,980 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-13 11:21:37,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 90 [2022-07-13 11:21:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:38,650 INFO L356 Elim1Store]: treesize reduction 67, result has 15.2 percent of original size [2022-07-13 11:21:38,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 105 [2022-07-13 11:21:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:39,758 INFO L356 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-07-13 11:21:39,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 113 [2022-07-13 11:21:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:41,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:41,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:41,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:42,004 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-13 11:21:42,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 90 [2022-07-13 11:21:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:42,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:42,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:43,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:43,038 INFO L356 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-07-13 11:21:43,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 100 treesize of output 99 [2022-07-13 11:21:43,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:43,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:44,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:44,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:44,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:44,103 INFO L356 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2022-07-13 11:21:44,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 80 treesize of output 92 [2022-07-13 11:21:45,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:45,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:45,321 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 11:21:45,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 52 [2022-07-13 11:21:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:45,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:48,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_141| Int)) (or (forall ((v_ArrVal_520 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_141|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* c_~N~0 2) 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_141|)))) is different from false [2022-07-13 11:21:50,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_141|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* c_~N~0 2) 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_141|)))) is different from false