./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:41:06,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:41:06,748 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:41:06,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:41:06,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:41:06,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:41:06,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:41:06,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:41:06,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:41:06,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:41:06,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:41:06,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:41:06,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:41:06,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:41:06,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:41:06,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:41:06,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:41:06,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:41:06,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:41:06,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:41:06,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:41:06,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:41:06,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 [2024-11-13 15:41:07,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:41:07,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:41:07,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:41:07,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:41:07,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:41:07,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i Unable to find full path for "g++" [2024-11-13 15:41:08,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:41:09,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:41:09,256 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2024-11-13 15:41:09,279 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/data/7be698b23/e52e96bbffa1448c93f290557a83c7f0/FLAGc283a02cd [2024-11-13 15:41:09,303 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/data/7be698b23/e52e96bbffa1448c93f290557a83c7f0 [2024-11-13 15:41:09,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:41:09,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:41:09,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:41:09,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:41:09,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:41:09,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:09,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aabd175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09, skipping insertion in model container [2024-11-13 15:41:09,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:09,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:41:09,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i[916,929] [2024-11-13 15:41:09,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:41:09,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:41:09,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i[916,929] [2024-11-13 15:41:09,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:41:09,949 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:41:09,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09 WrapperNode [2024-11-13 15:41:09,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:41:09,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:41:09,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:41:09,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:41:09,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:09,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,053 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-11-13 15:41:10,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:41:10,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:41:10,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:41:10,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:41:10,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:41:10,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:41:10,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:41:10,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:41:10,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:41:10,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (1/1) ... [2024-11-13 15:41:10,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:41:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:10,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:41:10,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:41:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:41:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:41:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:41:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:41:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:41:10,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:41:10,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:41:10,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:41:11,615 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-13 15:41:11,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:41:11,637 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:41:11,639 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:41:11,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:41:11 BoogieIcfgContainer [2024-11-13 15:41:11,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:41:11,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:41:11,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:41:11,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:41:11,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:41:09" (1/3) ... [2024-11-13 15:41:11,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b502746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:41:11, skipping insertion in model container [2024-11-13 15:41:11,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:41:09" (2/3) ... [2024-11-13 15:41:11,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b502746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:41:11, skipping insertion in model container [2024-11-13 15:41:11,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:41:11" (3/3) ... [2024-11-13 15:41:11,652 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-62.i [2024-11-13 15:41:11,670 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:41:11,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-62.i that has 2 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:41:11,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:41:11,778 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2358059b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:41:11,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:41:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 128 states have (on average 1.46875) internal successors, (188), 129 states have internal predecessors, (188), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-13 15:41:11,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:11,817 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:11,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1262204614, now seen corresponding path program 1 times [2024-11-13 15:41:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202293155] [2024-11-13 15:41:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:13,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202293155] [2024-11-13 15:41:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202293155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:13,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:41:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137406988] [2024-11-13 15:41:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:13,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:41:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:41:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:41:13,064 INFO L87 Difference]: Start difference. First operand has 187 states, 128 states have (on average 1.46875) internal successors, (188), 129 states have internal predecessors, (188), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-13 15:41:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:13,119 INFO L93 Difference]: Finished difference Result 365 states and 648 transitions. [2024-11-13 15:41:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:41:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 369 [2024-11-13 15:41:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:13,133 INFO L225 Difference]: With dead ends: 365 [2024-11-13 15:41:13,133 INFO L226 Difference]: Without dead ends: 181 [2024-11-13 15:41:13,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:41:13,141 INFO L432 NwaCegarLoop]: 289 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, 289 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 [2024-11-13 15:41:13,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:41:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-13 15:41:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-13 15:41:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2024-11-13 15:41:13,225 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 369 [2024-11-13 15:41:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2024-11-13 15:41:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-13 15:41:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2024-11-13 15:41:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-13 15:41:13,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:13,243 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:13,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:41:13,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:13,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 296337794, now seen corresponding path program 1 times [2024-11-13 15:41:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:13,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255378943] [2024-11-13 15:41:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255378943] [2024-11-13 15:41:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255378943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:41:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821242139] [2024-11-13 15:41:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:14,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:41:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:41:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:14,107 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:14,281 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2024-11-13 15:41:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:41:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2024-11-13 15:41:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:14,287 INFO L225 Difference]: With dead ends: 520 [2024-11-13 15:41:14,287 INFO L226 Difference]: Without dead ends: 342 [2024-11-13 15:41:14,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:14,289 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 254 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:14,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 756 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:41:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-13 15:41:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2024-11-13 15:41:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2024-11-13 15:41:14,324 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 369 [2024-11-13 15:41:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2024-11-13 15:41:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2024-11-13 15:41:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-13 15:41:14,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:14,336 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:41:14,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1401461119, now seen corresponding path program 1 times [2024-11-13 15:41:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530244738] [2024-11-13 15:41:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:15,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530244738] [2024-11-13 15:41:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530244738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:41:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584870338] [2024-11-13 15:41:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:41:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:15,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:41:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:15,052 INFO L87 Difference]: Start difference. First operand 199 states and 319 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:15,121 INFO L93 Difference]: Finished difference Result 396 states and 636 transitions. [2024-11-13 15:41:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:41:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2024-11-13 15:41:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:15,127 INFO L225 Difference]: With dead ends: 396 [2024-11-13 15:41:15,127 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 15:41:15,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:15,132 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:15,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 557 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:41:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 15:41:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2024-11-13 15:41:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4609929078014185) internal successors, (206), 141 states have internal predecessors, (206), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2024-11-13 15:41:15,166 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 370 [2024-11-13 15:41:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:15,168 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2024-11-13 15:41:15,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2024-11-13 15:41:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-13 15:41:15,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:15,175 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:41:15,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:15,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash -721402749, now seen corresponding path program 1 times [2024-11-13 15:41:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922020175] [2024-11-13 15:41:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922020175] [2024-11-13 15:41:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922020175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:15,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:15,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:41:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793802588] [2024-11-13 15:41:15,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:15,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:41:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:15,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:41:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:41:15,976 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:16,036 INFO L93 Difference]: Finished difference Result 395 states and 633 transitions. [2024-11-13 15:41:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:41:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2024-11-13 15:41:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:16,040 INFO L225 Difference]: With dead ends: 395 [2024-11-13 15:41:16,040 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 15:41:16,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:41:16,042 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:16,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 845 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:41:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 15:41:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-13 15:41:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2024-11-13 15:41:16,062 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 370 [2024-11-13 15:41:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:16,063 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2024-11-13 15:41:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2024-11-13 15:41:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-13 15:41:16,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:16,072 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:41:16,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1750762047, now seen corresponding path program 1 times [2024-11-13 15:41:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390546139] [2024-11-13 15:41:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390546139] [2024-11-13 15:41:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390546139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:17,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:17,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:41:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451303421] [2024-11-13 15:41:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:17,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:41:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:17,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:41:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:41:17,230 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:17,325 INFO L93 Difference]: Finished difference Result 395 states and 631 transitions. [2024-11-13 15:41:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:41:17,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2024-11-13 15:41:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:17,330 INFO L225 Difference]: With dead ends: 395 [2024-11-13 15:41:17,330 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 15:41:17,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:41:17,334 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 162 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:17,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 555 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:41:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 15:41:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-13 15:41:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.446808510638298) internal successors, (204), 141 states have internal predecessors, (204), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 15:41:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 316 transitions. [2024-11-13 15:41:17,372 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 316 transitions. Word has length 370 [2024-11-13 15:41:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:17,374 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 316 transitions. [2024-11-13 15:41:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2024-11-13 15:41:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-13 15:41:17,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:17,383 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:17,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:41:17,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:17,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:17,383 INFO L85 PathProgramCache]: Analyzing trace with hash -394522915, now seen corresponding path program 1 times [2024-11-13 15:41:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758498786] [2024-11-13 15:41:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758498786] [2024-11-13 15:41:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758498786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:41:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762173244] [2024-11-13 15:41:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:19,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:41:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:41:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:41:19,119 INFO L87 Difference]: Start difference. First operand 199 states and 316 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:19,784 INFO L93 Difference]: Finished difference Result 592 states and 943 transitions. [2024-11-13 15:41:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:41:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 371 [2024-11-13 15:41:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:19,792 INFO L225 Difference]: With dead ends: 592 [2024-11-13 15:41:19,795 INFO L226 Difference]: Without dead ends: 396 [2024-11-13 15:41:19,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:41:19,799 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 173 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:19,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 984 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:41:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-13 15:41:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 308. [2024-11-13 15:41:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 193 states have internal predecessors, (264), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 15:41:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 488 transitions. [2024-11-13 15:41:19,893 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 488 transitions. Word has length 371 [2024-11-13 15:41:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:19,895 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 488 transitions. [2024-11-13 15:41:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 488 transitions. [2024-11-13 15:41:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-13 15:41:19,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:19,904 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:19,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:41:19,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:19,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 148769347, now seen corresponding path program 1 times [2024-11-13 15:41:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015752011] [2024-11-13 15:41:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:41:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015752011] [2024-11-13 15:41:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015752011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769780460] [2024-11-13 15:41:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:22,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:22,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:22,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:22,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:41:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 15:41:23,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4269 proven. 213 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2024-11-13 15:41:25,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 411 proven. 231 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2024-11-13 15:41:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769780460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:27,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:41:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 28 [2024-11-13 15:41:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941188916] [2024-11-13 15:41:27,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 15:41:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 15:41:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2024-11-13 15:41:27,398 INFO L87 Difference]: Start difference. First operand 308 states and 488 transitions. Second operand has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2024-11-13 15:41:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:30,487 INFO L93 Difference]: Finished difference Result 664 states and 1003 transitions. [2024-11-13 15:41:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 15:41:30,489 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) Word has length 372 [2024-11-13 15:41:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:30,497 INFO L225 Difference]: With dead ends: 664 [2024-11-13 15:41:30,499 INFO L226 Difference]: Without dead ends: 468 [2024-11-13 15:41:30,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 838 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=893, Invalid=2413, Unknown=0, NotChecked=0, Total=3306 [2024-11-13 15:41:30,504 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1266 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:30,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 957 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:41:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-13 15:41:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 445. [2024-11-13 15:41:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 313 states have (on average 1.3706070287539935) internal successors, (429), 314 states have internal predecessors, (429), 117 states have call successors, (117), 14 states have call predecessors, (117), 14 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-13 15:41:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 663 transitions. [2024-11-13 15:41:30,586 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 663 transitions. Word has length 372 [2024-11-13 15:41:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:30,588 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 663 transitions. [2024-11-13 15:41:30,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2024-11-13 15:41:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 663 transitions. [2024-11-13 15:41:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-13 15:41:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:30,598 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:30,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:41:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 15:41:30,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1634578954, now seen corresponding path program 1 times [2024-11-13 15:41:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790008541] [2024-11-13 15:41:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:41:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790008541] [2024-11-13 15:41:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790008541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325473708] [2024-11-13 15:41:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:33,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:33,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:41:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:33,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:41:33,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 685 proven. 156 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2024-11-13 15:41:35,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 9 proven. 156 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:41:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325473708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:36,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:41:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-11-13 15:41:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104374024] [2024-11-13 15:41:36,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:41:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:36,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:41:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:41:36,334 INFO L87 Difference]: Start difference. First operand 445 states and 663 transitions. Second operand has 17 states, 17 states have (on average 13.294117647058824) internal successors, (226), 17 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2024-11-13 15:41:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:39,370 INFO L93 Difference]: Finished difference Result 873 states and 1283 transitions. [2024-11-13 15:41:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 15:41:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.294117647058824) internal successors, (226), 17 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 374 [2024-11-13 15:41:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:39,379 INFO L225 Difference]: With dead ends: 873 [2024-11-13 15:41:39,379 INFO L226 Difference]: Without dead ends: 564 [2024-11-13 15:41:39,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=1378, Unknown=0, NotChecked=0, Total=1806 [2024-11-13 15:41:39,381 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1057 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:39,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1834 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:41:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-13 15:41:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 482. [2024-11-13 15:41:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 343 states have (on average 1.3411078717201166) internal successors, (460), 344 states have internal predecessors, (460), 117 states have call successors, (117), 21 states have call predecessors, (117), 21 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-13 15:41:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 694 transitions. [2024-11-13 15:41:39,470 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 694 transitions. Word has length 374 [2024-11-13 15:41:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 694 transitions. [2024-11-13 15:41:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.294117647058824) internal successors, (226), 17 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2024-11-13 15:41:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 694 transitions. [2024-11-13 15:41:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-13 15:41:39,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:39,475 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:39,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:41:39,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 15:41:39,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1719250822, now seen corresponding path program 1 times [2024-11-13 15:41:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993868939] [2024-11-13 15:41:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993868939] [2024-11-13 15:41:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993868939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:41:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239590219] [2024-11-13 15:41:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:41:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:41:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:41:40,413 INFO L87 Difference]: Start difference. First operand 482 states and 694 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:40,893 INFO L93 Difference]: Finished difference Result 1033 states and 1529 transitions. [2024-11-13 15:41:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:41:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2024-11-13 15:41:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:40,904 INFO L225 Difference]: With dead ends: 1033 [2024-11-13 15:41:40,904 INFO L226 Difference]: Without dead ends: 699 [2024-11-13 15:41:40,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:41:40,906 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 249 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:40,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1094 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:41:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-13 15:41:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 514. [2024-11-13 15:41:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 375 states have (on average 1.3573333333333333) internal successors, (509), 376 states have internal predecessors, (509), 117 states have call successors, (117), 21 states have call predecessors, (117), 21 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-13 15:41:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 743 transitions. [2024-11-13 15:41:40,996 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 743 transitions. Word has length 374 [2024-11-13 15:41:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:40,997 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 743 transitions. [2024-11-13 15:41:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 743 transitions. [2024-11-13 15:41:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:41:41,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:41,003 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:41:41,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1410512300, now seen corresponding path program 1 times [2024-11-13 15:41:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660312994] [2024-11-13 15:41:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:41:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:41:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:41:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:41:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:41:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:41:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:41:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:41:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:41:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:41:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:41:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:41:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:41:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:41:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:41:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:41:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:41:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:41:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:41:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:41:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:41:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:41:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:41:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:41:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:41:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:41:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:41:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:41:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:41:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:41:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:41:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:41:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:41:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:41:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:41:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:41:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:41:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:41:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:41:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:41:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:41:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:41:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:41:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:41:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:41:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:41:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:41:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:41:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:41:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:41:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:41:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:41:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:41:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660312994] [2024-11-13 15:41:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660312994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:41:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153551444] [2024-11-13 15:41:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:41:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:41:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:41,346 INFO L87 Difference]: Start difference. First operand 514 states and 743 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:41,555 INFO L93 Difference]: Finished difference Result 1219 states and 1775 transitions. [2024-11-13 15:41:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:41:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2024-11-13 15:41:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:41,563 INFO L225 Difference]: With dead ends: 1219 [2024-11-13 15:41:41,563 INFO L226 Difference]: Without dead ends: 869 [2024-11-13 15:41:41,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:41,565 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 245 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:41,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 536 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:41:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-13 15:41:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 651. [2024-11-13 15:41:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 512 states have (on average 1.396484375) internal successors, (715), 513 states have internal predecessors, (715), 117 states have call successors, (117), 21 states have call predecessors, (117), 21 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-13 15:41:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 949 transitions. [2024-11-13 15:41:41,649 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 949 transitions. Word has length 375 [2024-11-13 15:41:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:41,650 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 949 transitions. [2024-11-13 15:41:41,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:41:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 949 transitions. [2024-11-13 15:41:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:41:41,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:41,653 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:41:41,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash 901039210, now seen corresponding path program 1 times [2024-11-13 15:41:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457208103] [2024-11-13 15:41:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:41:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714839378] [2024-11-13 15:41:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:43,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:43,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:43,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:41:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:43,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 15:41:43,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3963 proven. 270 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2024-11-13 15:41:46,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457208103] [2024-11-13 15:41:46,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:41:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714839378] [2024-11-13 15:41:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714839378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:46,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:41:46,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-13 15:41:46,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385622005] [2024-11-13 15:41:46,947 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:46,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:41:46,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:46,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:41:46,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:41:46,949 INFO L87 Difference]: Start difference. First operand 651 states and 949 transitions. Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-13 15:41:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:48,290 INFO L93 Difference]: Finished difference Result 1959 states and 2883 transitions. [2024-11-13 15:41:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:41:48,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 375 [2024-11-13 15:41:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:48,301 INFO L225 Difference]: With dead ends: 1959 [2024-11-13 15:41:48,301 INFO L226 Difference]: Without dead ends: 1458 [2024-11-13 15:41:48,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:41:48,305 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 668 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:48,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1921 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:41:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-13 15:41:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1170. [2024-11-13 15:41:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 955 states have (on average 1.4083769633507854) internal successors, (1345), 957 states have internal predecessors, (1345), 178 states have call successors, (178), 36 states have call predecessors, (178), 36 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-13 15:41:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1701 transitions. [2024-11-13 15:41:48,462 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1701 transitions. Word has length 375 [2024-11-13 15:41:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:48,463 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1701 transitions. [2024-11-13 15:41:48,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-13 15:41:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1701 transitions. [2024-11-13 15:41:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:41:48,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:48,469 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:41:48,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:41:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 15:41:48,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 419958952, now seen corresponding path program 1 times [2024-11-13 15:41:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356619900] [2024-11-13 15:41:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:41:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538089471] [2024-11-13 15:41:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:49,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:49,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:41:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:50,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 15:41:50,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2427 proven. 165 refuted. 0 times theorem prover too weak. 3568 trivial. 0 not checked. [2024-11-13 15:41:50,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:55,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse1 (+ .cse2 1)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_48 Int) (v_z_42 Int)) (or (< 255 v_z_42) (< .cse0 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (forall ((v_z_46 Int)) (or (< .cse0 v_z_46) (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0))) (or (and (<= (mod (div .cse0 .cse2) 4294967296) 0) (forall ((v_z_37 Int)) (or (< (div .cse0 v_z_37) 1) (< 255 v_z_37) (< v_z_37 .cse1)))) (< 4294967294 .cse0))))) is different from false [2024-11-13 15:42:01,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse1 (+ .cse2 1))) (and (or (< 5 .cse0) (and (forall ((v_z_37 Int)) (or (< (div .cse0 v_z_37) 1) (< v_z_37 .cse1))) (forall ((v_z_46 Int)) (or (< .cse0 v_z_46) (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0))) (forall ((v_z_48 Int) (v_z_42 Int)) (or (< .cse0 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (<= (mod (div .cse0 .cse2) 4294967296) 0))) (or (< .cse0 6) (and (<= (mod (div 5 .cse2) 4294967296) 0) (forall ((v_z_46 Int)) (or (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0) (< 5 v_z_46))) (forall ((v_z_48 Int) (v_z_42 Int)) (or (< 5 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (forall ((v_z_37 Int)) (or (< (div 5 v_z_37) 1) (< v_z_37 .cse1)))))))) is different from false [2024-11-13 15:42:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:42:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356619900] [2024-11-13 15:42:13,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:42:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538089471] [2024-11-13 15:42:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538089471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:42:13,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:42:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-13 15:42:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329140588] [2024-11-13 15:42:13,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:42:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:42:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:42:13,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:42:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2024-11-13 15:42:13,301 INFO L87 Difference]: Start difference. First operand 1170 states and 1701 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2024-11-13 15:42:20,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse1 (+ .cse2 1))) (and (<= .cse0 0) (or (< 5 .cse0) (and (forall ((v_z_37 Int)) (or (< (div .cse0 v_z_37) 1) (< v_z_37 .cse1))) (forall ((v_z_46 Int)) (or (< .cse0 v_z_46) (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0))) (forall ((v_z_48 Int) (v_z_42 Int)) (or (< .cse0 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (<= (mod (div .cse0 .cse2) 4294967296) 0))) (or (< .cse0 6) (and (<= (mod (div 5 .cse2) 4294967296) 0) (forall ((v_z_46 Int)) (or (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0) (< 5 v_z_46))) (forall ((v_z_48 Int) (v_z_42 Int)) (or (< 5 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (forall ((v_z_37 Int)) (or (< (div 5 v_z_37) 1) (< v_z_37 .cse1))))) (<= 32767 .cse2)))) is different from false [2024-11-13 15:42:20,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse1 (+ .cse2 1)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_48 Int) (v_z_42 Int)) (or (< 255 v_z_42) (< .cse0 v_z_48) (< v_z_42 .cse1) (< (div v_z_48 v_z_42) 1))) (forall ((v_z_46 Int)) (or (< .cse0 v_z_46) (< (mod (div v_z_46 .cse2) 4294967296) 1) (< v_z_46 0))) (or (and (<= (mod (div .cse0 .cse2) 4294967296) 0) (forall ((v_z_37 Int)) (or (< (div .cse0 v_z_37) 1) (< 255 v_z_37) (< v_z_37 .cse1)))) (< 4294967294 .cse0)) (= 0 c_~var_1_7~0) (<= 32767 .cse2)))) is different from false [2024-11-13 15:42:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:28,134 INFO L93 Difference]: Finished difference Result 3278 states and 4689 transitions. [2024-11-13 15:42:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:42:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 375 [2024-11-13 15:42:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:28,152 INFO L225 Difference]: With dead ends: 3278 [2024-11-13 15:42:28,153 INFO L226 Difference]: Without dead ends: 2404 [2024-11-13 15:42:28,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=174, Invalid=390, Unknown=4, NotChecked=188, Total=756 [2024-11-13 15:42:28,157 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 442 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1913 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:28,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2774 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1609 Invalid, 0 Unknown, 1913 Unchecked, 9.2s Time] [2024-11-13 15:42:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-13 15:42:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2022. [2024-11-13 15:42:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1647 states have (on average 1.3982999392835458) internal successors, (2303), 1651 states have internal predecessors, (2303), 306 states have call successors, (306), 68 states have call predecessors, (306), 68 states have return successors, (306), 302 states have call predecessors, (306), 306 states have call successors, (306) [2024-11-13 15:42:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2915 transitions. [2024-11-13 15:42:28,441 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2915 transitions. Word has length 375 [2024-11-13 15:42:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 2022 states and 2915 transitions. [2024-11-13 15:42:28,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2024-11-13 15:42:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2915 transitions. [2024-11-13 15:42:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:42:28,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:28,448 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:42:28,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:42:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 15:42:28,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:42:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -601109402, now seen corresponding path program 1 times [2024-11-13 15:42:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096936976] [2024-11-13 15:42:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:42:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090657858] [2024-11-13 15:42:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:42:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:42:29,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:42:29,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:42:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:30,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:42:30,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:42:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2433 proven. 42 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2024-11-13 15:42:33,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:42:34,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse3 1)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse2 (div v_z_77 .cse3)) (.cse1 (* v_y_64 4294967296))) (or (< .cse0 v_z_77) (< (+ .cse1 4294967295) .cse2) (< .cse2 (+ .cse1 1)) (< v_z_77 0)))) (or (and (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse6 (* v_y_64 4294967296)) (.cse5 (div .cse0 v_z_66))) (or (< v_z_66 .cse4) (< 255 v_z_66) (< .cse5 (+ .cse6 1)) (< (+ .cse6 4294967295) .cse5)))) (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse3)) 4294967296))) (< 4294967294 .cse0)) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse8 (div v_z_75 v_z_70)) (.cse7 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< .cse0 v_z_75) (< 255 v_z_70) (< v_z_75 0) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)))))))) is different from false [2024-11-13 15:42:44,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse1 1)) (.cse0 (mod c_~var_1_75~0 256))) (and (or (< 5 .cse0) (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse1)) 4294967296)) (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse3 (div v_z_77 .cse1)) (.cse2 (* v_y_64 4294967296))) (or (< (+ .cse2 4294967295) .cse3) (< .cse3 (+ .cse2 1)) (< v_z_77 0) (< .cse0 v_z_77)))) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse6 (div v_z_75 v_z_70)) (.cse5 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< v_z_75 0) (< (+ .cse5 4294967295) .cse6) (< .cse0 v_z_75) (< .cse6 (+ .cse5 1))))) (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse8 (div .cse0 v_z_66)) (.cse7 (* v_y_64 4294967296))) (or (< v_z_66 .cse4) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1))))))) (or (and (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse10 (div v_z_77 .cse1)) (.cse9 (* v_y_64 4294967296))) (or (< (+ .cse9 4294967295) .cse10) (< 5 v_z_77) (< .cse10 (+ .cse9 1)) (< v_z_77 0)))) (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse12 (div 5 v_z_66)) (.cse11 (* v_y_64 4294967296))) (or (< v_z_66 .cse4) (< (+ .cse11 4294967295) .cse12) (< .cse12 (+ .cse11 1))))) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse14 (div v_z_75 v_z_70)) (.cse13 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< 5 v_z_75) (< v_z_75 0) (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1))))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse1)) 4294967296))) (< .cse0 6))))) is different from false [2024-11-13 15:43:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:43:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:43:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096936976] [2024-11-13 15:43:05,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:43:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090657858] [2024-11-13 15:43:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090657858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:43:05,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:43:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-13 15:43:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71693528] [2024-11-13 15:43:05,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:43:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:43:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:43:05,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:43:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2024-11-13 15:43:05,470 INFO L87 Difference]: Start difference. First operand 2022 states and 2915 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-13 15:43:12,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse1 1)) (.cse0 (mod c_~var_1_75~0 256))) (and (<= .cse0 0) (or (< 5 .cse0) (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse1)) 4294967296)) (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse3 (div v_z_77 .cse1)) (.cse2 (* v_y_64 4294967296))) (or (< (+ .cse2 4294967295) .cse3) (< .cse3 (+ .cse2 1)) (< v_z_77 0) (< .cse0 v_z_77)))) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse6 (div v_z_75 v_z_70)) (.cse5 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< v_z_75 0) (< (+ .cse5 4294967295) .cse6) (< .cse0 v_z_75) (< .cse6 (+ .cse5 1))))) (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse8 (div .cse0 v_z_66)) (.cse7 (* v_y_64 4294967296))) (or (< v_z_66 .cse4) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1))))))) (<= 32767 .cse1) (or (and (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse10 (div v_z_77 .cse1)) (.cse9 (* v_y_64 4294967296))) (or (< (+ .cse9 4294967295) .cse10) (< 5 v_z_77) (< .cse10 (+ .cse9 1)) (< v_z_77 0)))) (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse12 (div 5 v_z_66)) (.cse11 (* v_y_64 4294967296))) (or (< v_z_66 .cse4) (< (+ .cse11 4294967295) .cse12) (< .cse12 (+ .cse11 1))))) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse14 (div v_z_75 v_z_70)) (.cse13 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< 5 v_z_75) (< v_z_75 0) (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1))))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse1)) 4294967296))) (< .cse0 6))))) is different from false [2024-11-13 15:43:13,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse3 1)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (= 0 c_~var_1_7~0) (forall ((v_y_64 Int) (v_z_77 Int)) (let ((.cse2 (div v_z_77 .cse3)) (.cse1 (* v_y_64 4294967296))) (or (< .cse0 v_z_77) (< (+ .cse1 4294967295) .cse2) (< .cse2 (+ .cse1 1)) (< v_z_77 0)))) (or (and (forall ((v_y_64 Int) (v_z_66 Int)) (let ((.cse6 (* v_y_64 4294967296)) (.cse5 (div .cse0 v_z_66))) (or (< v_z_66 .cse4) (< 255 v_z_66) (< .cse5 (+ .cse6 1)) (< (+ .cse6 4294967295) .cse5)))) (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse3)) 4294967296))) (< 4294967294 .cse0)) (<= 32767 .cse3) (forall ((v_z_70 Int) (v_z_75 Int) (v_y_64 Int)) (let ((.cse8 (div v_z_75 v_z_70)) (.cse7 (* v_y_64 4294967296))) (or (< v_z_70 .cse4) (< .cse0 v_z_75) (< 255 v_z_70) (< v_z_75 0) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)))))))) is different from false [2024-11-13 15:43:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:19,864 INFO L93 Difference]: Finished difference Result 4054 states and 5790 transitions. [2024-11-13 15:43:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:43:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 375 [2024-11-13 15:43:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:19,881 INFO L225 Difference]: With dead ends: 4054 [2024-11-13 15:43:19,882 INFO L226 Difference]: Without dead ends: 2408 [2024-11-13 15:43:19,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=174, Invalid=390, Unknown=4, NotChecked=188, Total=756 [2024-11-13 15:43:19,888 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 454 mSDsluCounter, 2593 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 100 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 1913 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:19,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 3108 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1674 Invalid, 14 Unknown, 1913 Unchecked, 9.1s Time] [2024-11-13 15:43:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-11-13 15:43:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2022. [2024-11-13 15:43:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1647 states have (on average 1.3982999392835458) internal successors, (2303), 1651 states have internal predecessors, (2303), 306 states have call successors, (306), 68 states have call predecessors, (306), 68 states have return successors, (306), 302 states have call predecessors, (306), 306 states have call successors, (306) [2024-11-13 15:43:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2915 transitions. [2024-11-13 15:43:20,240 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2915 transitions. Word has length 375 [2024-11-13 15:43:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:20,244 INFO L471 AbstractCegarLoop]: Abstraction has 2022 states and 2915 transitions. [2024-11-13 15:43:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-13 15:43:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2915 transitions. [2024-11-13 15:43:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:43:20,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:20,256 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:20,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:43:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 15:43:20,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2086144560, now seen corresponding path program 1 times [2024-11-13 15:43:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:43:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130153830] [2024-11-13 15:43:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:43:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:43:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:43:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:43:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:43:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:43:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:43:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:43:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:43:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:43:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:43:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:43:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:43:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:43:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:43:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:43:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:43:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:43:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:43:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:43:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:43:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:43:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:43:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:43:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:43:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:43:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:43:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:43:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:43:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:43:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:43:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:43:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:43:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:43:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:43:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:43:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:43:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:43:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:43:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:43:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:43:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:43:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:43:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:43:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:43:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:43:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:43:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:43:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:43:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:43:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:43:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:43:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:43:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:43:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:43:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:43:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:43:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:43:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:43:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130153830] [2024-11-13 15:43:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130153830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:43:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742214885] [2024-11-13 15:43:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:22,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:43:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:43:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:43:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:43:22,749 INFO L87 Difference]: Start difference. First operand 2022 states and 2915 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:43:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:27,507 INFO L93 Difference]: Finished difference Result 3464 states and 4916 transitions. [2024-11-13 15:43:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:43:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2024-11-13 15:43:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:27,516 INFO L225 Difference]: With dead ends: 3464 [2024-11-13 15:43:27,520 INFO L226 Difference]: Without dead ends: 1818 [2024-11-13 15:43:27,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:43:27,528 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 351 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:27,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 949 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 15:43:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-13 15:43:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1702. [2024-11-13 15:43:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1333 states have (on average 1.3255813953488371) internal successors, (1767), 1337 states have internal predecessors, (1767), 298 states have call successors, (298), 70 states have call predecessors, (298), 70 states have return successors, (298), 294 states have call predecessors, (298), 298 states have call successors, (298) [2024-11-13 15:43:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2363 transitions. [2024-11-13 15:43:27,821 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2363 transitions. Word has length 375 [2024-11-13 15:43:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2363 transitions. [2024-11-13 15:43:27,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:43:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2363 transitions. [2024-11-13 15:43:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:43:27,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:27,832 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:27,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:43:27,832 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1385479382, now seen corresponding path program 1 times [2024-11-13 15:43:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:43:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984066838] [2024-11-13 15:43:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:43:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:43:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:43:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:43:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:43:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:43:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:43:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:43:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:43:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:43:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:43:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:43:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:43:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:43:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:43:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:43:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:43:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:43:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:43:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:43:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:43:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:43:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:43:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:43:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:43:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:43:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:43:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:43:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:43:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:43:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:43:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:43:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:43:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:43:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:43:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:43:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:43:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:43:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:43:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:43:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:43:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:43:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:43:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:43:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:43:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:43:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:43:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:43:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:43:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:43:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:43:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:43:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:43:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:43:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:43:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:43:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:43:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:43:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:43:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984066838] [2024-11-13 15:43:28,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984066838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:28,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:43:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620535943] [2024-11-13 15:43:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:28,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:43:28,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:43:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:43:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:43:28,939 INFO L87 Difference]: Start difference. First operand 1702 states and 2363 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:43:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:29,688 INFO L93 Difference]: Finished difference Result 2978 states and 4124 transitions. [2024-11-13 15:43:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:43:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2024-11-13 15:43:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:29,705 INFO L225 Difference]: With dead ends: 2978 [2024-11-13 15:43:29,705 INFO L226 Difference]: Without dead ends: 1656 [2024-11-13 15:43:29,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:43:29,711 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 149 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:29,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 514 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:43:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-13 15:43:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2024-11-13 15:43:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1287 states have (on average 1.306138306138306) internal successors, (1681), 1291 states have internal predecessors, (1681), 298 states have call successors, (298), 70 states have call predecessors, (298), 70 states have return successors, (298), 294 states have call predecessors, (298), 298 states have call successors, (298) [2024-11-13 15:43:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2277 transitions. [2024-11-13 15:43:30,002 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2277 transitions. Word has length 375 [2024-11-13 15:43:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:30,003 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2277 transitions. [2024-11-13 15:43:30,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:43:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2277 transitions. [2024-11-13 15:43:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:43:30,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:30,011 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:30,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:43:30,011 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1824024346, now seen corresponding path program 1 times [2024-11-13 15:43:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:43:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035951311] [2024-11-13 15:43:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:43:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:43:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449683288] [2024-11-13 15:43:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:30,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:30,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:43:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:31,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:43:31,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2433 proven. 42 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2024-11-13 15:43:33,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:43:39,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~var_1_58~0 65536))) (let ((.cse3 (mod c_~var_1_7~0 4294967296)) (.cse2 (+ .cse4 1))) (and (or (and (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse1 (div .cse3 v_z_93)) (.cse0 (* v_y_106 4294967296))) (or (< (+ 4294967295 .cse0) .cse1) (< v_z_93 .cse2) (< 255 v_z_93) (< .cse1 (+ .cse0 1))))) (<= 4294967295 (mod (+ 4294967295 (div .cse3 .cse4)) 4294967296))) (< 4294967294 .cse3)) (forall ((v_z_104 Int)) (or (< .cse3 v_z_104) (< (mod (div v_z_104 .cse4) 4294967296) 1) (< v_z_104 0))) (forall ((v_z_101 Int) (v_z_98 Int)) (or (< .cse3 v_z_101) (< v_z_98 .cse2) (< 255 v_z_98) (< (div v_z_101 v_z_98) 1)))))) is different from false [2024-11-13 15:43:47,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse0 (+ .cse1 1)) (.cse4 (mod c_~var_1_75~0 256))) (and (or (and (forall ((v_z_101 Int) (v_z_98 Int)) (or (< v_z_98 .cse0) (< 5 v_z_101) (< (div v_z_101 v_z_98) 1))) (forall ((v_z_104 Int)) (or (< 5 v_z_104) (< (mod (div v_z_104 .cse1) 4294967296) 1) (< v_z_104 0))) (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse3 (* v_y_106 4294967296)) (.cse2 (div 5 v_z_93))) (or (< v_z_93 .cse0) (< .cse2 (+ .cse3 1)) (< (+ 4294967295 .cse3) .cse2)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse1)) 4294967296))) (< .cse4 6)) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse4 .cse1)) 4294967296)) (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse6 (div .cse4 v_z_93)) (.cse5 (* v_y_106 4294967296))) (or (< (+ 4294967295 .cse5) .cse6) (< v_z_93 .cse0) (< .cse6 (+ .cse5 1))))) (forall ((v_z_104 Int)) (or (< .cse4 v_z_104) (< (mod (div v_z_104 .cse1) 4294967296) 1) (< v_z_104 0))) (forall ((v_z_101 Int) (v_z_98 Int)) (or (< v_z_98 .cse0) (< .cse4 v_z_101) (< (div v_z_101 v_z_98) 1)))) (< 5 .cse4))))) is different from false [2024-11-13 15:44:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:44:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:44:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035951311] [2024-11-13 15:44:04,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:44:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449683288] [2024-11-13 15:44:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449683288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:44:04,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:44:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-13 15:44:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234301625] [2024-11-13 15:44:04,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:44:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:44:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:44:04,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:44:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2024-11-13 15:44:04,225 INFO L87 Difference]: Start difference. First operand 1656 states and 2277 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-13 15:44:12,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse1 1)) (.cse0 (mod c_~var_1_75~0 256))) (and (<= .cse0 0) (<= 32767 .cse1) (or (and (forall ((v_z_101 Int) (v_z_98 Int)) (or (< v_z_98 .cse2) (< 5 v_z_101) (< (div v_z_101 v_z_98) 1))) (forall ((v_z_104 Int)) (or (< 5 v_z_104) (< (mod (div v_z_104 .cse1) 4294967296) 1) (< v_z_104 0))) (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse4 (* v_y_106 4294967296)) (.cse3 (div 5 v_z_93))) (or (< v_z_93 .cse2) (< .cse3 (+ .cse4 1)) (< (+ 4294967295 .cse4) .cse3)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse1)) 4294967296))) (< .cse0 6)) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse1)) 4294967296)) (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse6 (div .cse0 v_z_93)) (.cse5 (* v_y_106 4294967296))) (or (< (+ 4294967295 .cse5) .cse6) (< v_z_93 .cse2) (< .cse6 (+ .cse5 1))))) (forall ((v_z_104 Int)) (or (< .cse0 v_z_104) (< (mod (div v_z_104 .cse1) 4294967296) 1) (< v_z_104 0))) (forall ((v_z_101 Int) (v_z_98 Int)) (or (< v_z_98 .cse2) (< .cse0 v_z_101) (< (div v_z_101 v_z_98) 1)))) (< 5 .cse0))))) is different from false [2024-11-13 15:44:12,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~var_1_58~0 65536))) (let ((.cse3 (mod c_~var_1_7~0 4294967296)) (.cse2 (+ .cse4 1))) (and (or (and (forall ((v_y_106 Int) (v_z_93 Int)) (let ((.cse1 (div .cse3 v_z_93)) (.cse0 (* v_y_106 4294967296))) (or (< (+ 4294967295 .cse0) .cse1) (< v_z_93 .cse2) (< 255 v_z_93) (< .cse1 (+ .cse0 1))))) (<= 4294967295 (mod (+ 4294967295 (div .cse3 .cse4)) 4294967296))) (< 4294967294 .cse3)) (= 0 c_~var_1_7~0) (<= 32767 .cse4) (forall ((v_z_104 Int)) (or (< .cse3 v_z_104) (< (mod (div v_z_104 .cse4) 4294967296) 1) (< v_z_104 0))) (forall ((v_z_101 Int) (v_z_98 Int)) (or (< .cse3 v_z_101) (< v_z_98 .cse2) (< 255 v_z_98) (< (div v_z_101 v_z_98) 1)))))) is different from false [2024-11-13 15:44:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:44:17,324 INFO L93 Difference]: Finished difference Result 3356 states and 4550 transitions. [2024-11-13 15:44:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:44:17,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 375 [2024-11-13 15:44:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:44:17,337 INFO L225 Difference]: With dead ends: 3356 [2024-11-13 15:44:17,337 INFO L226 Difference]: Without dead ends: 2080 [2024-11-13 15:44:17,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=174, Invalid=390, Unknown=4, NotChecked=188, Total=756 [2024-11-13 15:44:17,342 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 692 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 348 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 1758 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:44:17,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2457 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1297 Invalid, 11 Unknown, 1758 Unchecked, 7.6s Time] [2024-11-13 15:44:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2024-11-13 15:44:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1698. [2024-11-13 15:44:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1329 states have (on average 1.3009781790820165) internal successors, (1729), 1333 states have internal predecessors, (1729), 298 states have call successors, (298), 70 states have call predecessors, (298), 70 states have return successors, (298), 294 states have call predecessors, (298), 298 states have call successors, (298) [2024-11-13 15:44:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2325 transitions. [2024-11-13 15:44:17,644 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2325 transitions. Word has length 375 [2024-11-13 15:44:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:44:17,645 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2325 transitions. [2024-11-13 15:44:17,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-13 15:44:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2325 transitions. [2024-11-13 15:44:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:44:17,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:44:17,649 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:44:17,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:44:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:44:17,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:44:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:44:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1449874596, now seen corresponding path program 1 times [2024-11-13 15:44:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:44:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494342278] [2024-11-13 15:44:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:44:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:44:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336584782] [2024-11-13 15:44:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:18,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:44:18,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:44:18,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:44:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:19,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 15:44:19,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:44:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2433 proven. 42 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2024-11-13 15:44:26,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:44:31,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse6 (+ .cse3 1)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse1 (div v_z_134 .cse3)) (.cse0 (* v_y_121 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< .cse2 v_z_134) (< .cse1 (+ .cse0 1)) (< v_z_134 0)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< 255 v_z_128) (< v_z_131 0) (< .cse2 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (or (< 4294967294 .cse2) (and (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div .cse2 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< 255 v_z_124) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div .cse2 .cse3)) 4294967296))))))) is different from false [2024-11-13 15:44:40,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256))) (or (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse6 (+ .cse3 1))) (and (or (< .cse0 6) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse2 (div v_z_134 .cse3)) (.cse1 (* v_y_121 4294967296))) (or (< (+ .cse1 4294967295) .cse2) (< .cse2 (+ .cse1 1)) (< v_z_134 0) (< 5 v_z_134)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< v_z_131 0) (< 5 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div 5 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse3)) 4294967296)))) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse3)) 4294967296)) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse10 (* v_y_121 4294967296)) (.cse9 (div v_z_131 v_z_128))) (or (< .cse9 (+ .cse10 1)) (< v_z_128 .cse6) (< v_z_131 0) (< .cse0 v_z_131) (< (+ .cse10 4294967295) .cse9)))) (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse12 (div v_z_134 .cse3)) (.cse11 (* v_y_121 4294967296))) (or (< (+ .cse11 4294967295) .cse12) (< .cse0 v_z_134) (< .cse12 (+ .cse11 1)) (< v_z_134 0)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse14 (div .cse0 v_z_124)) (.cse13 (* v_y_121 4294967296))) (or (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1)) (< v_z_124 .cse6))))) (< 5 .cse0))))) (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296)))) is different from false [2024-11-13 15:45:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:45:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494342278] [2024-11-13 15:45:28,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:45:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336584782] [2024-11-13 15:45:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336584782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:45:28,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:45:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-13 15:45:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226700998] [2024-11-13 15:45:28,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:45:28,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:45:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:45:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=202, Unknown=5, NotChecked=62, Total=342 [2024-11-13 15:45:28,338 INFO L87 Difference]: Start difference. First operand 1698 states and 2325 transitions. Second operand has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2024-11-13 15:45:37,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse3 (mod c_~var_1_58~0 65536))) (and (<= .cse0 0) (or (let ((.cse6 (+ .cse3 1))) (and (or (< .cse0 6) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse2 (div v_z_134 .cse3)) (.cse1 (* v_y_121 4294967296))) (or (< (+ .cse1 4294967295) .cse2) (< .cse2 (+ .cse1 1)) (< v_z_134 0) (< 5 v_z_134)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< v_z_131 0) (< 5 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div 5 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse3)) 4294967296)))) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse3)) 4294967296)) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse10 (* v_y_121 4294967296)) (.cse9 (div v_z_131 v_z_128))) (or (< .cse9 (+ .cse10 1)) (< v_z_128 .cse6) (< v_z_131 0) (< .cse0 v_z_131) (< (+ .cse10 4294967295) .cse9)))) (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse12 (div v_z_134 .cse3)) (.cse11 (* v_y_121 4294967296))) (or (< (+ .cse11 4294967295) .cse12) (< .cse0 v_z_134) (< .cse12 (+ .cse11 1)) (< v_z_134 0)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse14 (div .cse0 v_z_124)) (.cse13 (* v_y_121 4294967296))) (or (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1)) (< v_z_124 .cse6))))) (< 5 .cse0)))) (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296))) (= (+ |c_ULTIMATE.start_step_~stepLocal_2~0#1| .cse0) 25) (<= 32767 .cse3) (= c_~var_1_29~0 25))) is different from false [2024-11-13 15:45:38,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse6 (+ .cse3 1)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse1 (div v_z_134 .cse3)) (.cse0 (* v_y_121 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< .cse2 v_z_134) (< .cse1 (+ .cse0 1)) (< v_z_134 0)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< 255 v_z_128) (< v_z_131 0) (< .cse2 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (or (< 4294967294 .cse2) (and (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div .cse2 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< 255 v_z_124) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div .cse2 .cse3)) 4294967296)))) (= 0 c_~var_1_7~0) (<= 32767 .cse3)))) is different from false [2024-11-13 15:45:42,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse6 (+ .cse3 1)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse1 (div v_z_134 .cse3)) (.cse0 (* v_y_121 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< .cse2 v_z_134) (< .cse1 (+ .cse0 1)) (< v_z_134 0)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< 255 v_z_128) (< v_z_131 0) (< .cse2 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (or (< 4294967294 .cse2) (and (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div .cse2 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< 255 v_z_124) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div .cse2 .cse3)) 4294967296)))) (<= 32767 .cse3) (= c_~var_1_29~0 25)))) is different from false [2024-11-13 15:45:54,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (mod c_~var_1_29~0 4294967296))) (let ((.cse3 (mod c_~var_1_58~0 65536)) (.cse16 (< 31 .cse17))) (and (let ((.cse0 (mod c_~var_1_75~0 256))) (or (let ((.cse6 (+ .cse3 1))) (and (or (< .cse0 6) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse2 (div v_z_134 .cse3)) (.cse1 (* v_y_121 4294967296))) (or (< (+ .cse1 4294967295) .cse2) (< .cse2 (+ .cse1 1)) (< v_z_134 0) (< 5 v_z_134)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse5 (* v_y_121 4294967296)) (.cse4 (div v_z_131 v_z_128))) (or (< .cse4 (+ .cse5 1)) (< v_z_128 .cse6) (< v_z_131 0) (< 5 v_z_131) (< (+ .cse5 4294967295) .cse4)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div 5 v_z_124))) (or (< v_z_124 .cse6) (< .cse7 (+ .cse8 1)) (< (+ .cse8 4294967295) .cse7)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse3)) 4294967296)))) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse3)) 4294967296)) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse10 (* v_y_121 4294967296)) (.cse9 (div v_z_131 v_z_128))) (or (< .cse9 (+ .cse10 1)) (< v_z_128 .cse6) (< v_z_131 0) (< .cse0 v_z_131) (< (+ .cse10 4294967295) .cse9)))) (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse12 (div v_z_134 .cse3)) (.cse11 (* v_y_121 4294967296))) (or (< (+ .cse11 4294967295) .cse12) (< .cse0 v_z_134) (< .cse12 (+ .cse11 1)) (< v_z_134 0)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse14 (div .cse0 v_z_124)) (.cse13 (* v_y_121 4294967296))) (or (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1)) (< v_z_124 .cse6))))) (< 5 .cse0)))) (let ((.cse15 (* 4294967295 .cse0))) (= (mod .cse15 4294967296) (mod (+ .cse15 c_~var_1_29~0) 4294967296))) .cse16)) (or (< 4294967294 (mod (+ (div 0 .cse3) 4294967295) 4294967296)) (= .cse17 0) .cse16)))) is different from false [2024-11-13 15:45:58,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:03,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:07,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:11,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:15,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:19,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:23,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:27,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:31,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:35,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:40,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:44,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:48,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:52,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:46:56,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:05,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:09,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:13,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:17,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:21,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:25,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:29,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:34,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:38,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:42,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:46,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:50,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:54,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:47:58,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:02,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:07,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:11,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:15,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:19,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:23,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:27,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:32,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:36,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:40,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:44,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:53,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:48:57,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:01,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:05,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:09,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:13,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:18,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:22,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:26,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:30,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:35,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:39,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:44,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:48,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:52,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:49:57,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:01,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:06,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:10,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:14,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:18,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:23,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:27,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:31,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:35,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:39,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:43,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:47,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:52,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:50:56,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:00,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:05,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:13,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:18,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:22,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:26,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:30,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:34,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:39,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:43,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:51:47,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_75~0 256))) (let ((.cse2 (* 4294967295 .cse3))) (let ((.cse0 (let ((.cse6 (mod c_~var_1_58~0 65536))) (let ((.cse9 (+ .cse6 1))) (and (or (< .cse3 6) (and (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse5 (div v_z_134 .cse6)) (.cse4 (* v_y_121 4294967296))) (or (< (+ .cse4 4294967295) .cse5) (< .cse5 (+ .cse4 1)) (< v_z_134 0) (< 5 v_z_134)))) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse8 (* v_y_121 4294967296)) (.cse7 (div v_z_131 v_z_128))) (or (< .cse7 (+ .cse8 1)) (< v_z_128 .cse9) (< v_z_131 0) (< 5 v_z_131) (< (+ .cse8 4294967295) .cse7)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse11 (* v_y_121 4294967296)) (.cse10 (div 5 v_z_124))) (or (< v_z_124 .cse9) (< .cse10 (+ .cse11 1)) (< (+ .cse11 4294967295) .cse10)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse6)) 4294967296)))) (or (and (<= 4294967295 (mod (+ 4294967295 (div .cse3 .cse6)) 4294967296)) (forall ((v_z_131 Int) (v_z_128 Int) (v_y_121 Int)) (let ((.cse13 (* v_y_121 4294967296)) (.cse12 (div v_z_131 v_z_128))) (or (< .cse12 (+ .cse13 1)) (< v_z_128 .cse9) (< v_z_131 0) (< .cse3 v_z_131) (< (+ .cse13 4294967295) .cse12)))) (forall ((v_z_134 Int) (v_y_121 Int)) (let ((.cse15 (div v_z_134 .cse6)) (.cse14 (* v_y_121 4294967296))) (or (< (+ .cse14 4294967295) .cse15) (< .cse3 v_z_134) (< .cse15 (+ .cse14 1)) (< v_z_134 0)))) (forall ((v_z_124 Int) (v_y_121 Int)) (let ((.cse17 (div .cse3 v_z_124)) (.cse16 (* v_y_121 4294967296))) (or (< (+ .cse16 4294967295) .cse17) (< .cse17 (+ .cse16 1)) (< v_z_124 .cse9))))) (< 5 .cse3)))))) (.cse1 (mod .cse2 4294967296))) (and (or .cse0 (= .cse1 (mod (+ .cse2 c_~var_1_29~0) 4294967296)) (< 31 (mod c_~var_1_29~0 4294967296))) (or .cse0 (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) .cse1) (< 31 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 4294967296))))))) is different from false [2024-11-13 15:51:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:57,757 INFO L93 Difference]: Finished difference Result 3602 states and 4870 transitions. [2024-11-13 15:51:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 15:51:57,759 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) Word has length 375 [2024-11-13 15:51:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:57,770 INFO L225 Difference]: With dead ends: 3602 [2024-11-13 15:51:57,770 INFO L226 Difference]: Without dead ends: 2290 [2024-11-13 15:51:57,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 731 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=128, Invalid=310, Unknown=10, NotChecked=308, Total=756 [2024-11-13 15:51:57,773 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 716 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 285 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 358.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 3810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 1679 IncrementalHoareTripleChecker+Unchecked, 371.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:57,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 2468 Invalid, 3810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1763 Invalid, 83 Unknown, 1679 Unchecked, 371.7s Time] [2024-11-13 15:51:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2024-11-13 15:51:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1790. [2024-11-13 15:51:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1411 states have (on average 1.3090007087172217) internal successors, (1847), 1416 states have internal predecessors, (1847), 305 states have call successors, (305), 73 states have call predecessors, (305), 73 states have return successors, (305), 300 states have call predecessors, (305), 305 states have call successors, (305) [2024-11-13 15:51:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2457 transitions. [2024-11-13 15:51:58,115 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2457 transitions. Word has length 375 [2024-11-13 15:51:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:58,116 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2457 transitions. [2024-11-13 15:51:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2024-11-13 15:51:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2457 transitions. [2024-11-13 15:51:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:51:58,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:58,123 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:58,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:51:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 15:51:58,326 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -424046550, now seen corresponding path program 1 times [2024-11-13 15:51:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:51:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548137087] [2024-11-13 15:51:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:51:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:51:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:51:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:51:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:51:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:51:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:51:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:51:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:51:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:51:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 15:51:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:51:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:51:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:51:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:51:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:51:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 15:51:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:51:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 15:51:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:51:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:51:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 15:51:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:51:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 15:51:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:51:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:51:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:51:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:51:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-13 15:51:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 15:51:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-13 15:51:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 15:51:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 15:51:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-13 15:51:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 15:51:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 15:51:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-13 15:51:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 15:51:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 15:51:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-13 15:51:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-13 15:51:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 15:51:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-13 15:51:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-13 15:51:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-13 15:51:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 15:51:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 15:51:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 15:51:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-13 15:51:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-13 15:51:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-13 15:51:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 15:51:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 15:51:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 15:51:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 15:51:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-13 15:51:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 15:51:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-13 15:51:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:51:59,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548137087] [2024-11-13 15:51:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548137087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:59,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:51:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43134142] [2024-11-13 15:51:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:59,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:51:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:51:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:51:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:51:59,078 INFO L87 Difference]: Start difference. First operand 1790 states and 2457 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:52:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:00,030 INFO L93 Difference]: Finished difference Result 3572 states and 4881 transitions. [2024-11-13 15:52:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:52:00,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2024-11-13 15:52:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:00,044 INFO L225 Difference]: With dead ends: 3572 [2024-11-13 15:52:00,044 INFO L226 Difference]: Without dead ends: 2114 [2024-11-13 15:52:00,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:52:00,048 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 182 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:00,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 800 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:52:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2024-11-13 15:52:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1790. [2024-11-13 15:52:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1411 states have (on average 1.299078667611623) internal successors, (1833), 1416 states have internal predecessors, (1833), 305 states have call successors, (305), 73 states have call predecessors, (305), 73 states have return successors, (305), 300 states have call predecessors, (305), 305 states have call successors, (305) [2024-11-13 15:52:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2443 transitions. [2024-11-13 15:52:00,393 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2443 transitions. Word has length 375 [2024-11-13 15:52:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:00,394 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2443 transitions. [2024-11-13 15:52:00,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-13 15:52:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2443 transitions. [2024-11-13 15:52:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:52:00,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:00,399 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:52:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:52:00,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:52:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1079490474, now seen corresponding path program 1 times [2024-11-13 15:52:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:52:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729978739] [2024-11-13 15:52:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:52:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:52:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543571157] [2024-11-13 15:52:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:01,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:01,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:01,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:52:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:01,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 15:52:01,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2433 proven. 42 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2024-11-13 15:52:10,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:52:15,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse0 (+ .cse2 1)) (.cse1 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< 255 v_z_157) (< v_z_157 .cse0) (< .cse1 v_z_160))) (or (and (forall ((v_z_154 Int)) (or (< 255 v_z_154) (< v_z_154 .cse0) (< (div .cse1 v_z_154) 1))) (<= (mod (div .cse1 .cse2) 4294967296) 0)) (< 4294967294 .cse1)) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< v_z_162 0) (< .cse1 v_z_162)))))) is different from false [2024-11-13 15:52:23,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256))) (or (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296)) (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse1 1))) (and (or (< 5 .cse0) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< .cse0 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse0 v_z_160) (< v_z_157 .cse2))) (<= (mod (div .cse0 .cse1) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse2) (< (div .cse0 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse1) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse2) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse2)))) (< .cse0 6))))))) is different from false [2024-11-13 15:52:29,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256))) (or (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296)) (< 31 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 4294967296)) (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse1 1))) (and (or (< 5 .cse0) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< .cse0 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse0 v_z_160) (< v_z_157 .cse2))) (<= (mod (div .cse0 .cse1) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse2) (< (div .cse0 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse1) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse2) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse2)))) (< .cse0 6))))))) is different from false [2024-11-13 15:52:34,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_75~0 256))) (or (let ((.cse0 (* 4294967295 .cse1))) (= (mod .cse0 4294967296) (mod (+ .cse0 c_~var_1_29~0) 4294967296))) (< 31 (mod c_~var_1_29~0 4294967296)) (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse3 (+ .cse2 1))) (and (or (< 5 .cse1) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< .cse1 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse1 v_z_160) (< v_z_157 .cse3))) (<= (mod (div .cse1 .cse2) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse3) (< (div .cse1 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse2) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse3) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse3)))) (< .cse1 6))))))) is different from false [2024-11-13 15:52:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:52:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:52:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729978739] [2024-11-13 15:52:56,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:52:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543571157] [2024-11-13 15:52:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543571157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:52:56,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:52:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-13 15:52:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162707192] [2024-11-13 15:52:56,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:52:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:52:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:52:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:52:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=159, Unknown=4, NotChecked=116, Total=342 [2024-11-13 15:52:56,395 INFO L87 Difference]: Start difference. First operand 1790 states and 2443 transitions. Second operand has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2024-11-13 15:53:06,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse2 (mod c_~var_1_58~0 65536))) (and (<= .cse0 0) (or (let ((.cse1 (* 4294967295 .cse0))) (= (mod .cse1 4294967296) (mod (+ .cse1 c_~var_1_29~0) 4294967296))) (< 31 (mod c_~var_1_29~0 4294967296)) (let ((.cse3 (+ .cse2 1))) (and (or (< 5 .cse0) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< .cse0 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse0 v_z_160) (< v_z_157 .cse3))) (<= (mod (div .cse0 .cse2) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse3) (< (div .cse0 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse2) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse3) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse3)))) (< .cse0 6))))) (<= 32767 .cse2) (= c_~var_1_29~0 25))) is different from false [2024-11-13 15:53:11,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse1 (mod c_~var_1_58~0 65536))) (and (<= .cse0 0) (= (+ |c_ULTIMATE.start_step_~stepLocal_2~0#1| .cse0) 25) (= |c_ULTIMATE.start_step_~stepLocal_1~0#1| 25) (<= 32767 .cse1) (or (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296)) (< 31 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 4294967296)) (let ((.cse2 (+ .cse1 1))) (and (or (< 5 .cse0) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< .cse0 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse0 v_z_160) (< v_z_157 .cse2))) (<= (mod (div .cse0 .cse1) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse2) (< (div .cse0 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse1) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse2) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse2)))) (< .cse0 6))))))) is different from false [2024-11-13 15:53:16,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_75~0 256)) (.cse1 (mod c_~var_1_58~0 65536))) (and (<= .cse0 0) (or (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse0) 4294967296)) (let ((.cse2 (+ .cse1 1))) (and (or (< 5 .cse0) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< .cse0 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse0 v_z_160) (< v_z_157 .cse2))) (<= (mod (div .cse0 .cse1) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse2) (< (div .cse0 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse1) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse1) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse2) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse2)))) (< .cse0 6))))) (= (+ |c_ULTIMATE.start_step_~stepLocal_2~0#1| .cse0) 25) (<= 32767 .cse1))) is different from false [2024-11-13 15:53:16,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_58~0 65536))) (let ((.cse0 (+ .cse2 1)) (.cse1 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< 255 v_z_157) (< v_z_157 .cse0) (< .cse1 v_z_160))) (or (and (forall ((v_z_154 Int)) (or (< 255 v_z_154) (< v_z_154 .cse0) (< (div .cse1 v_z_154) 1))) (<= (mod (div .cse1 .cse2) 4294967296) 0)) (< 4294967294 .cse1)) (= 0 c_~var_1_7~0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse2) 4294967296) 1) (< v_z_162 0) (< .cse1 v_z_162))) (<= 32767 .cse2)))) is different from false [2024-11-13 15:53:31,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~var_1_29~0 4294967296))) (let ((.cse3 (mod c_~var_1_58~0 65536)) (.cse2 (< 31 .cse5))) (and (let ((.cse1 (mod c_~var_1_75~0 256))) (or (let ((.cse0 (* 4294967295 .cse1))) (= (mod .cse0 4294967296) (mod (+ .cse0 c_~var_1_29~0) 4294967296))) .cse2 (let ((.cse4 (+ .cse3 1))) (and (or (< 5 .cse1) (and (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse3) 4294967296) 1) (< .cse1 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< .cse1 v_z_160) (< v_z_157 .cse4))) (<= (mod (div .cse1 .cse3) 4294967296) 0) (forall ((v_z_154 Int)) (or (< v_z_154 .cse4) (< (div .cse1 v_z_154) 1))))) (or (and (<= (mod (div 5 .cse3) 4294967296) 0) (forall ((v_z_162 Int)) (or (< (mod (div v_z_162 .cse3) 4294967296) 1) (< 5 v_z_162) (< v_z_162 0))) (forall ((v_z_157 Int) (v_z_160 Int)) (or (< (div v_z_160 v_z_157) 1) (< v_z_157 .cse4) (< 5 v_z_160))) (forall ((v_z_154 Int)) (or (< (div 5 v_z_154) 1) (< v_z_154 .cse4)))) (< .cse1 6)))))) (or (= .cse5 0) (< (mod (div 0 .cse3) 4294967296) 1) .cse2)))) is different from false [2024-11-13 15:53:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:34,176 INFO L93 Difference]: Finished difference Result 4490 states and 6097 transitions. [2024-11-13 15:53:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 15:53:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) Word has length 375 [2024-11-13 15:53:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:34,191 INFO L225 Difference]: With dead ends: 4490 [2024-11-13 15:53:34,192 INFO L226 Difference]: Without dead ends: 3204 [2024-11-13 15:53:34,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=222, Invalid=561, Unknown=9, NotChecked=540, Total=1332 [2024-11-13 15:53:34,197 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 943 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 7508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5041 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:34,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 3395 Invalid, 7508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2102 Invalid, 0 Unknown, 5041 Unchecked, 16.8s Time] [2024-11-13 15:53:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2024-11-13 15:53:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2630. [2024-11-13 15:53:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2054 states have (on average 1.3037974683544304) internal successors, (2678), 2061 states have internal predecessors, (2678), 465 states have call successors, (465), 110 states have call predecessors, (465), 110 states have return successors, (465), 458 states have call predecessors, (465), 465 states have call successors, (465) [2024-11-13 15:53:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3608 transitions. [2024-11-13 15:53:34,739 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3608 transitions. Word has length 375 [2024-11-13 15:53:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 2630 states and 3608 transitions. [2024-11-13 15:53:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 4 states have call successors, (112), 3 states have call predecessors, (112), 5 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2024-11-13 15:53:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3608 transitions. [2024-11-13 15:53:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:53:34,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:34,745 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:34,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:53:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:34,949 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:53:34,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1164492824, now seen corresponding path program 1 times [2024-11-13 15:53:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678452919] [2024-11-13 15:53:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:53:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607782850] [2024-11-13 15:53:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:35,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:35,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:53:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:36,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 15:53:36,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2427 proven. 165 refuted. 0 times theorem prover too weak. 3568 trivial. 0 not checked. [2024-11-13 15:53:40,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:46,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_58~0 65536))) (let ((.cse3 (+ .cse6 1)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse1 (* v_y_180 4294967296)) (.cse0 (div v_z_189 v_z_183))) (or (< .cse0 (+ .cse1 1)) (< v_z_189 0) (< .cse2 v_z_189) (< (+ .cse1 4294967295) .cse0) (< 255 v_z_183) (< v_z_183 .cse3)))) (or (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse5 (div .cse2 v_z_191)) (.cse4 (* v_y_180 4294967296))) (or (< (+ .cse4 4294967295) .cse5) (< .cse5 (+ .cse4 1)) (< v_z_191 .cse3) (< 255 v_z_191)))) (<= 4294967295 (mod (+ 4294967295 (div .cse2 .cse6)) 4294967296))) (< 4294967294 .cse2)) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse8 (div v_z_187 .cse6)) (.cse7 (* v_y_180 4294967296))) (or (< .cse2 v_z_187) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)) (< v_z_187 0))))))) is different from false [2024-11-13 15:53:57,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse7 1)) (.cse8 (mod c_~var_1_75~0 256))) (and (or (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse1 (div 5 v_z_191)) (.cse0 (* v_y_180 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< v_z_191 .cse2) (< .cse1 (+ .cse0 1))))) (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse4 (* v_y_180 4294967296)) (.cse3 (div v_z_189 v_z_183))) (or (< .cse3 (+ .cse4 1)) (< 5 v_z_189) (< v_z_189 0) (< (+ .cse4 4294967295) .cse3) (< v_z_183 .cse2)))) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse6 (div v_z_187 .cse7)) (.cse5 (* v_y_180 4294967296))) (or (< 5 v_z_187) (< (+ .cse5 4294967295) .cse6) (< .cse6 (+ .cse5 1)) (< v_z_187 0)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse7)) 4294967296))) (< .cse8 6)) (or (< 5 .cse8) (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse10 (* v_y_180 4294967296)) (.cse9 (div .cse8 v_z_191))) (or (< .cse9 (+ .cse10 1)) (< v_z_191 .cse2) (< (+ .cse10 4294967295) .cse9)))) (<= 4294967295 (mod (+ 4294967295 (div .cse8 .cse7)) 4294967296)) (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse12 (* v_y_180 4294967296)) (.cse11 (div v_z_189 v_z_183))) (or (< .cse11 (+ .cse12 1)) (< .cse8 v_z_189) (< v_z_189 0) (< (+ .cse12 4294967295) .cse11) (< v_z_183 .cse2)))) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse14 (div v_z_187 .cse7)) (.cse13 (* v_y_180 4294967296))) (or (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1)) (< .cse8 v_z_187) (< v_z_187 0))))))))) is different from false [2024-11-13 15:54:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-13 15:54:22,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678452919] [2024-11-13 15:54:22,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:54:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607782850] [2024-11-13 15:54:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607782850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:54:22,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-13 15:54:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915182991] [2024-11-13 15:54:22,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:22,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:54:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:54:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2024-11-13 15:54:22,798 INFO L87 Difference]: Start difference. First operand 2630 states and 3608 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2024-11-13 15:54:32,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse7 1)) (.cse8 (mod c_~var_1_75~0 256))) (and (or (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse1 (div 5 v_z_191)) (.cse0 (* v_y_180 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< v_z_191 .cse2) (< .cse1 (+ .cse0 1))))) (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse4 (* v_y_180 4294967296)) (.cse3 (div v_z_189 v_z_183))) (or (< .cse3 (+ .cse4 1)) (< 5 v_z_189) (< v_z_189 0) (< (+ .cse4 4294967295) .cse3) (< v_z_183 .cse2)))) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse6 (div v_z_187 .cse7)) (.cse5 (* v_y_180 4294967296))) (or (< 5 v_z_187) (< (+ .cse5 4294967295) .cse6) (< .cse6 (+ .cse5 1)) (< v_z_187 0)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse7)) 4294967296))) (< .cse8 6)) (<= .cse8 0) (<= 32767 .cse7) (or (< 5 .cse8) (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse10 (* v_y_180 4294967296)) (.cse9 (div .cse8 v_z_191))) (or (< .cse9 (+ .cse10 1)) (< v_z_191 .cse2) (< (+ .cse10 4294967295) .cse9)))) (<= 4294967295 (mod (+ 4294967295 (div .cse8 .cse7)) 4294967296)) (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse12 (* v_y_180 4294967296)) (.cse11 (div v_z_189 v_z_183))) (or (< .cse11 (+ .cse12 1)) (< .cse8 v_z_189) (< v_z_189 0) (< (+ .cse12 4294967295) .cse11) (< v_z_183 .cse2)))) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse14 (div v_z_187 .cse7)) (.cse13 (* v_y_180 4294967296))) (or (< (+ .cse13 4294967295) .cse14) (< .cse14 (+ .cse13 1)) (< .cse8 v_z_187) (< v_z_187 0))))))))) is different from false [2024-11-13 15:54:32,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_58~0 65536))) (let ((.cse3 (+ .cse6 1)) (.cse2 (mod c_~var_1_7~0 4294967296))) (and (forall ((v_z_189 Int) (v_y_180 Int) (v_z_183 Int)) (let ((.cse1 (* v_y_180 4294967296)) (.cse0 (div v_z_189 v_z_183))) (or (< .cse0 (+ .cse1 1)) (< v_z_189 0) (< .cse2 v_z_189) (< (+ .cse1 4294967295) .cse0) (< 255 v_z_183) (< v_z_183 .cse3)))) (= 0 c_~var_1_7~0) (or (and (forall ((v_y_180 Int) (v_z_191 Int)) (let ((.cse5 (div .cse2 v_z_191)) (.cse4 (* v_y_180 4294967296))) (or (< (+ .cse4 4294967295) .cse5) (< .cse5 (+ .cse4 1)) (< v_z_191 .cse3) (< 255 v_z_191)))) (<= 4294967295 (mod (+ 4294967295 (div .cse2 .cse6)) 4294967296))) (< 4294967294 .cse2)) (<= 32767 .cse6) (forall ((v_z_187 Int) (v_y_180 Int)) (let ((.cse8 (div v_z_187 .cse6)) (.cse7 (* v_y_180 4294967296))) (or (< .cse2 v_z_187) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)) (< v_z_187 0))))))) is different from false [2024-11-13 15:54:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:38,287 INFO L93 Difference]: Finished difference Result 4778 states and 6463 transitions. [2024-11-13 15:54:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:54:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 375 [2024-11-13 15:54:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:38,308 INFO L225 Difference]: With dead ends: 4778 [2024-11-13 15:54:38,308 INFO L226 Difference]: Without dead ends: 3486 [2024-11-13 15:54:38,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=174, Invalid=390, Unknown=4, NotChecked=188, Total=756 [2024-11-13 15:54:38,313 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 849 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1758 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:38,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1930 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1143 Invalid, 0 Unknown, 1758 Unchecked, 9.5s Time] [2024-11-13 15:54:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2024-11-13 15:54:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2618. [2024-11-13 15:54:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2042 states have (on average 1.3026444662095984) internal successors, (2660), 2049 states have internal predecessors, (2660), 465 states have call successors, (465), 110 states have call predecessors, (465), 110 states have return successors, (465), 458 states have call predecessors, (465), 465 states have call successors, (465) [2024-11-13 15:54:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3590 transitions. [2024-11-13 15:54:38,836 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3590 transitions. Word has length 375 [2024-11-13 15:54:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:38,837 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3590 transitions. [2024-11-13 15:54:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2024-11-13 15:54:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3590 transitions. [2024-11-13 15:54:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-13 15:54:38,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:38,841 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:38,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:54:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:39,041 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:54:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -951848346, now seen corresponding path program 1 times [2024-11-13 15:54:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019003859] [2024-11-13 15:54:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:54:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503138064] [2024-11-13 15:54:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:39,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:39,937 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:39,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0406ac2-6fec-453d-bbca-a08d23551ceb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:54:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:40,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 15:54:40,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3521 proven. 168 refuted. 0 times theorem prover too weak. 2471 trivial. 0 not checked. [2024-11-13 15:54:54,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:55,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse5 1)) (.cse1 (mod c_~var_1_49~0 4294967296)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (or (< .cse0 .cse1) (and (forall ((v_y_209 Int) (v_z_211 Int)) (let ((.cse4 (div .cse1 v_z_211)) (.cse3 (* v_y_209 4294967296))) (or (< v_z_211 .cse2) (< 255 v_z_211) (< (+ .cse3 4294967295) .cse4) (< .cse4 (+ .cse3 1))))) (<= 4294967295 (mod (+ (div .cse1 .cse5) 4294967295) 4294967296)))) (or (and (forall ((v_y_209 Int) (v_z_214 Int)) (let ((.cse7 (div .cse0 v_z_214)) (.cse6 (* v_y_209 4294967296))) (or (< (+ .cse6 4294967295) .cse7) (< .cse7 (+ .cse6 1)) (< v_z_214 .cse2) (< 255 v_z_214)))) (<= 4294967295 (mod (+ 4294967295 (div .cse0 .cse5)) 4294967296))) (< .cse1 (+ .cse0 1)))))) is different from false [2024-11-13 15:55:06,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_75~0 256))) (or (let ((.cse5 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse5 1)) (.cse1 (mod c_~var_1_49~0 4294967296))) (let ((.cse0 (and (forall ((v_y_209 Int) (v_z_211 Int)) (let ((.cse10 (div .cse1 v_z_211)) (.cse9 (* v_y_209 4294967296))) (or (< v_z_211 .cse4) (< (+ .cse9 4294967295) .cse10) (< .cse10 (+ .cse9 1))))) (<= 4294967295 (mod (+ (div .cse1 .cse5) 4294967295) 4294967296))))) (and (or (and (or .cse0 (< 5 .cse1)) (or (and (forall ((v_y_209 Int) (v_z_214 Int)) (let ((.cse3 (div 5 v_z_214)) (.cse2 (* v_y_209 4294967296))) (or (< (+ .cse2 4294967295) .cse3) (< .cse3 (+ .cse2 1)) (< v_z_214 .cse4)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse5)) 4294967296))) (< .cse1 6))) (< .cse6 6)) (or (< 5 .cse6) (and (or (< .cse1 (+ .cse6 1)) (and (<= 4294967295 (mod (+ 4294967295 (div .cse6 .cse5)) 4294967296)) (forall ((v_y_209 Int) (v_z_214 Int)) (let ((.cse8 (div .cse6 v_z_214)) (.cse7 (* v_y_209 4294967296))) (or (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)) (< v_z_214 .cse4)))))) (or (< .cse6 .cse1) .cse0))))))) (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse6) 4294967296)))) is different from false [2024-11-13 15:55:12,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_75~0 256))) (or (let ((.cse5 (mod c_~var_1_58~0 65536))) (let ((.cse4 (+ .cse5 1)) (.cse1 (mod c_~var_1_49~0 4294967296))) (let ((.cse0 (and (forall ((v_y_209 Int) (v_z_211 Int)) (let ((.cse10 (div .cse1 v_z_211)) (.cse9 (* v_y_209 4294967296))) (or (< v_z_211 .cse4) (< (+ .cse9 4294967295) .cse10) (< .cse10 (+ .cse9 1))))) (<= 4294967295 (mod (+ (div .cse1 .cse5) 4294967295) 4294967296))))) (and (or (and (or .cse0 (< 5 .cse1)) (or (and (forall ((v_y_209 Int) (v_z_214 Int)) (let ((.cse3 (div 5 v_z_214)) (.cse2 (* v_y_209 4294967296))) (or (< (+ .cse2 4294967295) .cse3) (< .cse3 (+ .cse2 1)) (< v_z_214 .cse4)))) (<= 4294967295 (mod (+ 4294967295 (div 5 .cse5)) 4294967296))) (< .cse1 6))) (< .cse6 6)) (or (< 5 .cse6) (and (or (< .cse1 (+ .cse6 1)) (and (<= 4294967295 (mod (+ 4294967295 (div .cse6 .cse5)) 4294967296)) (forall ((v_y_209 Int) (v_z_214 Int)) (let ((.cse8 (div .cse6 v_z_214)) (.cse7 (* v_y_209 4294967296))) (or (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1)) (< v_z_214 .cse4)))))) (or (< .cse6 .cse1) .cse0))))))) (= (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296) (mod (* 4294967295 .cse6) 4294967296)) (< 31 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 4294967296)))) is different from false