./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB --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 c1b5c482da5d2c6667d34018776f68ea028be3d534a2149af7f706efb36af7e7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:01:08,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:01:08,494 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:01:08,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:01:08,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:01:08,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:01:08,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:01:08,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:01:08,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:01:08,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:01:08,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:01:08,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:01:08,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:01:08,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:01:08,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:01:08,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:01:08,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:01:08,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:01:08,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:01:08,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:01:08,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:01:08,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:01:08,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:01:08,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:01:08,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:01:08,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:08,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:01:08,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:01:08,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:01:08,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:01:08,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:08,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:01:08,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:01:08,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:01:08,534 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_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c1b5c482da5d2c6667d34018776f68ea028be3d534a2149af7f706efb36af7e7 [2024-11-28 05:01:08,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:01:08,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:01:08,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:01:08,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:01:08,860 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:01:08,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i [2024-11-28 05:01:11,835 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/data/79897a87e/4f5a7083bd32419a89c0c6d46310930d/FLAG67675f8a0 [2024-11-28 05:01:12,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:01:12,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i [2024-11-28 05:01:12,128 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/data/79897a87e/4f5a7083bd32419a89c0c6d46310930d/FLAG67675f8a0 [2024-11-28 05:01:12,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/data/79897a87e/4f5a7083bd32419a89c0c6d46310930d [2024-11-28 05:01:12,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:01:12,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:01:12,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:01:12,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:01:12,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:01:12,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6120eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12, skipping insertion in model container [2024-11-28 05:01:12,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:01:12,380 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_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i[914,927] [2024-11-28 05:01:12,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:01:12,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:01:12,443 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_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-6.i[914,927] [2024-11-28 05:01:12,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:01:12,485 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:01:12,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12 WrapperNode [2024-11-28 05:01:12,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:01:12,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:01:12,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:01:12,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:01:12,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,551 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-28 05:01:12,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:01:12,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:01:12,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:01:12,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:01:12,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,592 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-28 05:01:12,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:01:12,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:01:12,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:01:12,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:01:12,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (1/1) ... [2024-11-28 05:01:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:12,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:01:12,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:01:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:01:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 05:01:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 05:01:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:01:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:01:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:01:12,807 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:01:12,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:01:13,208 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-28 05:01:13,209 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:01:13,223 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:01:13,223 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:01:13,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:13 BoogieIcfgContainer [2024-11-28 05:01:13,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:01:13,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:01:13,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:01:13,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:01:13,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:01:12" (1/3) ... [2024-11-28 05:01:13,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5b7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:13, skipping insertion in model container [2024-11-28 05:01:13,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:12" (2/3) ... [2024-11-28 05:01:13,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5b7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:13, skipping insertion in model container [2024-11-28 05:01:13,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:13" (3/3) ... [2024-11-28 05:01:13,239 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-6.i [2024-11-28 05:01:13,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:01:13,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-6.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:01:13,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:01:13,332 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;@60e099be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:01:13,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:01:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-28 05:01:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:01:13,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:13,353 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:01:13,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:01:13,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-11-28 05:01:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861196728] [2024-11-28 05:01:13,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-28 05:01:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861196728] [2024-11-28 05:01:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861196728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719016433] [2024-11-28 05:01:13,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:13,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:13,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:01:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:13,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:01:13,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-28 05:01:14,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:01:14,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719016433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:14,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:01:14,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 05:01:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424216780] [2024-11-28 05:01:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:01:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:01:14,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:01:14,070 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:01:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:14,111 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-11-28 05:01:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:01:14,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-28 05:01:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:14,120 INFO L225 Difference]: With dead ends: 101 [2024-11-28 05:01:14,120 INFO L226 Difference]: Without dead ends: 50 [2024-11-28 05:01:14,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-28 05:01:14,127 INFO L435 NwaCegarLoop]: 74 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, 74 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-28 05:01:14,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:01:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-28 05:01:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-28 05:01:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-28 05:01:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-11-28 05:01:14,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-11-28 05:01:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-11-28 05:01:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:01:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-28 05:01:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:01:14,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:14,177 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:01:14,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:01:14,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 05:01:14,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:01:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-11-28 05:01:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559511722] [2024-11-28 05:01:14,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:58,537 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 137 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:01:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:01:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559511722] [2024-11-28 05:01:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559511722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:01:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298704609] [2024-11-28 05:01:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:01:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:58,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:01:58,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:01:58,631 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:02:06,649 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 [] [2024-11-28 05:02:10,664 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 [] [2024-11-28 05:02:17,756 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 [] [2024-11-28 05:02:21,784 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 [] [2024-11-28 05:02:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:29,001 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2024-11-28 05:02:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:02:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-28 05:02:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:29,006 INFO L225 Difference]: With dead ends: 141 [2024-11-28 05:02:29,006 INFO L226 Difference]: Without dead ends: 139 [2024-11-28 05:02:29,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:02:29,008 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 78 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:29,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 452 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 210 Invalid, 4 Unknown, 0 Unchecked, 21.3s Time] [2024-11-28 05:02:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-28 05:02:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2024-11-28 05:02:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 05:02:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-28 05:02:29,044 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 118 [2024-11-28 05:02:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:29,045 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-28 05:02:29,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:02:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-28 05:02:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:02:29,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:29,047 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:02:29,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:02:29,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:02:29,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-11-28 05:02:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496398028] [2024-11-28 05:02:29,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:02:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496398028] [2024-11-28 05:02:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496398028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:47,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:47,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:02:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146479891] [2024-11-28 05:02:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:47,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:02:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:47,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:02:47,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:02:47,602 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:02:53,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:02:58,400 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 [] [2024-11-28 05:03:20,246 WARN L286 SmtUtils]: Spent 20.95s on a formula simplification. DAG size of input: 130 DAG size of output: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:03:24,508 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 [] [2024-11-28 05:03:25,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:03:29,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:03:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:36,716 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2024-11-28 05:03:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:03:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-28 05:03:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:36,719 INFO L225 Difference]: With dead ends: 139 [2024-11-28 05:03:36,719 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 05:03:36,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-28 05:03:36,721 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 98 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:36,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 469 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 306 Invalid, 2 Unknown, 0 Unchecked, 18.1s Time] [2024-11-28 05:03:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 05:03:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-28 05:03:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 05:03:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-28 05:03:36,742 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 118 [2024-11-28 05:03:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:36,742 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-28 05:03:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:03:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-28 05:03:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 05:03:36,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:36,745 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:03:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:03:36,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:03:36,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-11-28 05:03:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560589991] [2024-11-28 05:03:36,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:03:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560589991] [2024-11-28 05:03:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560589991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:03:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:03:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:03:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005712273] [2024-11-28 05:03:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:03:36,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:03:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:03:36,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:03:36,975 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:03:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:37,406 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-11-28 05:03:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:03:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-28 05:03:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:37,410 INFO L225 Difference]: With dead ends: 288 [2024-11-28 05:03:37,412 INFO L226 Difference]: Without dead ends: 186 [2024-11-28 05:03:37,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:03:37,414 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:37,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:03:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-28 05:03:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-28 05:03:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:03:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2024-11-28 05:03:37,476 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 119 [2024-11-28 05:03:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:37,477 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2024-11-28 05:03:37,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:03:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2024-11-28 05:03:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 05:03:37,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:37,484 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:03:37,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:03:37,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:03:37,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-11-28 05:03:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979047731] [2024-11-28 05:03:37,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:03:52,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979047731] [2024-11-28 05:03:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979047731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:03:52,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:03:52,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:03:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833471940] [2024-11-28 05:03:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:03:52,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:03:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:52,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:03:52,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:03:52,811 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:03:57,989 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 [] [2024-11-28 05:03:59,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:04:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:05,404 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-28 05:04:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:04:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-28 05:04:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:05,407 INFO L225 Difference]: With dead ends: 219 [2024-11-28 05:04:05,407 INFO L226 Difference]: Without dead ends: 217 [2024-11-28 05:04:05,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:04:05,408 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:05,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 536 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-28 05:04:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-28 05:04:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2024-11-28 05:04:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 91 states have internal predecessors, (117), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:04:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-28 05:04:05,446 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 119 [2024-11-28 05:04:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:05,446 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-28 05:04:05,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:04:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-28 05:04:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 05:04:05,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:05,449 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:04:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:04:05,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:04:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1975438289, now seen corresponding path program 1 times [2024-11-28 05:04:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900023607] [2024-11-28 05:04:05,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:04:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900023607] [2024-11-28 05:04:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900023607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:04:29,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:04:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:04:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720832185] [2024-11-28 05:04:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:04:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:04:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:29,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:04:29,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:04:29,645 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:04:41,903 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 145 DAG size of output: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:04:45,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:04:46,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:04:50,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:04:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:57,611 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-28 05:04:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:04:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-28 05:04:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:57,614 INFO L225 Difference]: With dead ends: 219 [2024-11-28 05:04:57,614 INFO L226 Difference]: Without dead ends: 217 [2024-11-28 05:04:57,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:04:57,616 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:57,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 531 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-28 05:04:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-28 05:04:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2024-11-28 05:04:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:04:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2024-11-28 05:04:57,647 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 119 [2024-11-28 05:04:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:57,648 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2024-11-28 05:04:57,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:04:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2024-11-28 05:04:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 05:04:57,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:57,650 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:04:57,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:04:57,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:04:57,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1634763599, now seen corresponding path program 1 times [2024-11-28 05:04:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009420910] [2024-11-28 05:04:57,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-28 05:04:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:57,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009420910] [2024-11-28 05:04:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009420910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:57,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561703374] [2024-11-28 05:04:57,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:57,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:57,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:57,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:57,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:04:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:58,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:04:58,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-28 05:04:58,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-28 05:04:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561703374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:04:59,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:04:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-11-28 05:04:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140278702] [2024-11-28 05:04:59,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:59,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:04:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:59,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:04:59,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:04:59,538 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-28 05:05:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:00,819 INFO L93 Difference]: Finished difference Result 593 states and 865 transitions. [2024-11-28 05:05:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:05:00,821 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 119 [2024-11-28 05:05:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:00,825 INFO L225 Difference]: With dead ends: 593 [2024-11-28 05:05:00,826 INFO L226 Difference]: Without dead ends: 446 [2024-11-28 05:05:00,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:05:00,829 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 167 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:05:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-28 05:05:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 294. [2024-11-28 05:05:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 170 states have (on average 1.2117647058823529) internal successors, (206), 170 states have internal predecessors, (206), 114 states have call successors, (114), 9 states have call predecessors, (114), 9 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-28 05:05:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-28 05:05:00,988 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 119 [2024-11-28 05:05:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:00,990 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-28 05:05:00,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-28 05:05:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-28 05:05:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-28 05:05:00,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:00,993 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:05:01,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:05:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 05:05:01,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:05:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1795166832, now seen corresponding path program 1 times [2024-11-28 05:05:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081978993] [2024-11-28 05:05:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 05:05:01,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437218636] [2024-11-28 05:05:01,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:01,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:01,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:01,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:05:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:01,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 05:05:01,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-28 05:05:03,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:05:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-28 05:05:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081978993] [2024-11-28 05:05:09,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 05:05:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437218636] [2024-11-28 05:05:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437218636] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:05:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-11-28 05:05:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290297777] [2024-11-28 05:05:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:05:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:05:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:05:09,678 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:05:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:13,522 INFO L93 Difference]: Finished difference Result 550 states and 800 transitions. [2024-11-28 05:05:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:05:13,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-28 05:05:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:13,526 INFO L225 Difference]: With dead ends: 550 [2024-11-28 05:05:13,526 INFO L226 Difference]: Without dead ends: 299 [2024-11-28 05:05:13,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:05:13,528 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:13,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 357 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 05:05:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-28 05:05:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 251. [2024-11-28 05:05:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 147 states have (on average 1.2040816326530612) internal successors, (177), 147 states have internal predecessors, (177), 95 states have call successors, (95), 8 states have call predecessors, (95), 8 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-28 05:05:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2024-11-28 05:05:13,636 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 120 [2024-11-28 05:05:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:13,639 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2024-11-28 05:05:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-28 05:05:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2024-11-28 05:05:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-28 05:05:13,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:13,645 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:13,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:05:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 05:05:13,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:05:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1254402368, now seen corresponding path program 1 times [2024-11-28 05:05:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164920406] [2024-11-28 05:05:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:05:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:21,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164920406] [2024-11-28 05:05:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164920406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:21,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:05:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572371465] [2024-11-28 05:05:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:21,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:05:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:21,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:05:21,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:05:21,732 INFO L87 Difference]: Start difference. First operand 251 states and 367 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:05:26,337 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 [] [2024-11-28 05:05:28,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:05:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:31,723 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2024-11-28 05:05:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:05:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 233 [2024-11-28 05:05:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:31,732 INFO L225 Difference]: With dead ends: 314 [2024-11-28 05:05:31,732 INFO L226 Difference]: Without dead ends: 312 [2024-11-28 05:05:31,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:05:31,733 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:31,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2024-11-28 05:05:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-28 05:05:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 255. [2024-11-28 05:05:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 151 states have (on average 1.218543046357616) internal successors, (184), 151 states have internal predecessors, (184), 95 states have call successors, (95), 8 states have call predecessors, (95), 8 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-28 05:05:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2024-11-28 05:05:31,808 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 233 [2024-11-28 05:05:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2024-11-28 05:05:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:05:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2024-11-28 05:05:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-28 05:05:31,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:31,814 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:31,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:05:31,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:05:31,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144066, now seen corresponding path program 1 times [2024-11-28 05:05:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112190114] [2024-11-28 05:05:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:43,076 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:05:59,274 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:05:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:05:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112190114] [2024-11-28 05:05:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112190114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:59,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:05:59,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054447699] [2024-11-28 05:05:59,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:59,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:05:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:59,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:05:59,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:05:59,331 INFO L87 Difference]: Start difference. First operand 255 states and 374 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:06:04,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:06:10,708 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:06:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:14,342 INFO L93 Difference]: Finished difference Result 300 states and 432 transitions. [2024-11-28 05:06:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:06:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 233 [2024-11-28 05:06:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:14,345 INFO L225 Difference]: With dead ends: 300 [2024-11-28 05:06:14,345 INFO L226 Difference]: Without dead ends: 298 [2024-11-28 05:06:14,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:06:14,346 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:14,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 330 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 05:06:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-28 05:06:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 151. [2024-11-28 05:06:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:06:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-28 05:06:14,403 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 233 [2024-11-28 05:06:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:14,404 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-28 05:06:14,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:06:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-28 05:06:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 05:06:14,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:14,412 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:14,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:06:14,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2000995963, now seen corresponding path program 1 times [2024-11-28 05:06:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003331697] [2024-11-28 05:06:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:06:24,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003331697] [2024-11-28 05:06:24,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003331697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:24,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:06:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176863884] [2024-11-28 05:06:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:24,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:06:24,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:24,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:06:24,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:06:24,852 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:06:32,392 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 [] [2024-11-28 05:06:39,642 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 [] [2024-11-28 05:06:43,645 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 [] [2024-11-28 05:06:47,648 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 [] [2024-11-28 05:06:54,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:06:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:54,819 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2024-11-28 05:06:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:06:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-28 05:06:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:54,821 INFO L225 Difference]: With dead ends: 170 [2024-11-28 05:06:54,821 INFO L226 Difference]: Without dead ends: 168 [2024-11-28 05:06:54,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:06:54,822 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:54,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 20.9s Time] [2024-11-28 05:06:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-28 05:06:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2024-11-28 05:06:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:06:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-28 05:06:54,875 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-28 05:06:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:54,878 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-28 05:06:54,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:06:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-28 05:06:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 05:06:54,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:54,882 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:54,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:06:54,882 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:54,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1943737661, now seen corresponding path program 1 times [2024-11-28 05:06:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871143024] [2024-11-28 05:06:54,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:07:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871143024] [2024-11-28 05:07:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871143024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081460438] [2024-11-28 05:07:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:08,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:08,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:07:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:08,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 05:07:08,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1161 proven. 138 refuted. 0 times theorem prover too weak. 1551 trivial. 0 not checked. [2024-11-28 05:07:51,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:37,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~last_1_var_1_6~0 65536))) (let ((.cse37 (mod c_~var_1_6~0 65536)) (.cse23 (mod c_~last_1_var_1_18~0 4294967296)) (.cse16 (mod c_~var_1_4~0 65536)) (.cse10 (= c_~last_1_var_1_18~0 .cse36)) (.cse33 (mod c_~var_1_1~0 4294967296))) (let ((.cse1 (= .cse33 128)) (.cse9 (= 1000000000 .cse33)) (.cse20 (+ c_~last_1_var_1_18~0 1)) (.cse14 (not .cse10)) (.cse38 (mod (div .cse36 .cse16) 4294967296)) (.cse17 (+ .cse23 1)) (.cse31 (mod (+ (* .cse37 c_~var_1_7~0) (* .cse37 .cse37)) 4294967296)) (.cse21 (mod c_~var_1_12~0 256))) (let ((.cse0 (= .cse21 1)) (.cse4 (<= .cse31 .cse33)) (.cse11 (<= .cse31 1000000000)) (.cse34 (< .cse38 .cse17)) (.cse19 (or (< .cse38 .cse20) .cse14)) (.cse13 (<= .cse31 128)) (.cse6 (= (mod c_~var_1_13~0 256) 0)) (.cse3 (= .cse37 (mod c_~var_1_11~0 65536))) (.cse18 (and .cse9 .cse10)) (.cse12 (not .cse1)) (.cse15 (+ .cse36 1)) (.cse22 (mod c_~var_1_17~0 256))) (and (or .cse0 (let ((.cse24 (= .cse21 0)) (.cse5 (or .cse18 .cse34))) (and (or (let ((.cse8 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< (mod (div v_z_30 .cse16) 4294967296) .cse17) (< v_z_30 .cse15)))) (.cse7 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< .cse23 (mod (div v_z_30 .cse16) 4294967296)) (< v_z_30 .cse15)))) (.cse2 (= .cse21 .cse22))) (and (or .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse1 (and .cse6 (or (and .cse2 .cse3 .cse4) .cse7) (or .cse8 (and .cse9 .cse2 .cse10 .cse3 .cse11)))) (or .cse12 (and .cse6 (or .cse8 (and .cse13 .cse2 .cse3 .cse14)) (or (and .cse13 .cse2 .cse3) .cse7))) (or .cse1 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse15) (< (mod (div v_z_32 .cse16) 4294967296) .cse17))) .cse18) (or .cse12 (and .cse19 .cse13 .cse2 .cse3)) (or .cse12 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse15) (< (mod (div v_z_32 .cse16) 4294967296) .cse20))) .cse14))) .cse24) (or (not .cse24) (let ((.cse30 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< .cse23 (mod (div v_z_33 .cse16) 4294967296)) (< v_z_33 .cse15)))) (.cse29 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse15) (< (mod (div v_z_33 .cse16) 4294967296) .cse17)))) (.cse28 (mod (+ .cse16 (* c_~var_1_1~0 4294967295)) 4294967296)) (.cse32 (not .cse9)) (.cse25 (= .cse22 0)) (.cse27 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse15) (< (mod (div v_z_34 .cse16) 4294967296) .cse17))))) (and (or .cse1 (and .cse3 .cse5)) (or .cse12 (and .cse19 .cse13 .cse3 .cse25)) (or .cse12 (let ((.cse26 (or (= .cse28 128) .cse3))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse15) (< .cse23 (mod (div v_z_34 .cse16) 4294967296)))) (and .cse13 .cse25 .cse26)) (or .cse27 (and .cse13 .cse25 .cse14 .cse26))))) (or .cse12 (and (or .cse29 (and .cse13 .cse3 .cse25 .cse14)) .cse6 (or .cse30 (and .cse13 .cse3 .cse25)))) (or (and (or (and (or (< .cse31 1000000001) .cse32) .cse3 .cse4 .cse25) .cse30) .cse6 (or .cse29 (and .cse9 .cse10 .cse3 .cse25 .cse11))) .cse1) (or .cse1 (and (or .cse3 (= .cse28 .cse33)) (or (and .cse3 .cse11) .cse32) .cse4 .cse25 (or .cse27 (and .cse9 .cse10 .cse3 .cse11)))))))))) (or (not .cse0) (let ((.cse35 (= .cse22 1))) (and (or .cse1 (and .cse35 .cse6 .cse3 .cse4 (or (and .cse9 .cse10 .cse11) .cse34))) (or .cse12 (and .cse19 .cse13 .cse35 .cse6 .cse3)) (or .cse12 .cse14 (forall ((v_z_29 Int)) (or (< (mod (div v_z_29 .cse16) 4294967296) .cse20) (< v_z_29 .cse15) (< 4294967295 v_z_29)))) (or .cse1 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse16) 4294967296) .cse17) (< v_z_28 .cse15) (< 4294967295 v_z_28))) .cse18) (or .cse1 (forall ((v_z_29 Int)) (or (< v_z_29 .cse15) (< (mod (div v_z_29 .cse16) 4294967296) .cse17) (< 4294967295 v_z_29))) .cse18) (or .cse12 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse16) 4294967296) .cse20) (< v_z_28 .cse15) (< 4294967295 v_z_28))) .cse14))))))))) is different from false [2024-11-28 05:11:01,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse61 (mod c_~var_1_11~0 65536)) (.cse28 (mod c_~last_1_var_1_6~0 65536)) (.cse7 (mod c_~var_1_1~0 4294967296))) (let ((.cse0 (= .cse7 128)) (.cse63 (= c_~last_1_var_1_18~0 .cse28)) (.cse62 (* .cse61 .cse61))) (let ((.cse8 (+ .cse7 4294967296)) (.cse5 (+ (mod c_~last_1_var_1_18~0 4294967296) 1)) (.cse1 (forall ((~var_1_7~0 Int)) (< .cse7 (mod (+ (* .cse61 ~var_1_7~0) .cse62) 4294967296)))) (.cse2 (and (= 1000000000 .cse7) .cse63)) (.cse9 (mod (* c_~var_1_1~0 4294967295) 4294967296)) (.cse3 (+ .cse28 1)) (.cse16 (+ c_~last_1_var_1_18~0 1)) (.cse14 (not .cse0)) (.cse17 (not .cse63)) (.cse18 (forall ((~var_1_7~0 Int)) (< 128 (mod (+ (* .cse61 ~var_1_7~0) .cse62) 4294967296))))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< v_z_30 .cse3) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse6 (+ .cse9 v_z_78)) (.cse4 (+ v_z_78 (* v_y_78 4294967296)))) (or (< (mod (div v_z_30 .cse4) 4294967296) .cse5) (= .cse6 .cse7) (< .cse4 0) (= .cse6 .cse8) (< 4294967295 v_z_78) (< 65535 .cse4) (< v_z_78 0)))))) (forall ((v_z_30 Int)) (or (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse10 (+ .cse9 v_z_78)) (.cse11 (+ v_z_78 (* v_y_78 4294967296)))) (or (< .cse10 4294967296) (= .cse10 .cse8) (< 4294967295 v_z_78) (< 65535 .cse11) (< (div v_z_30 .cse11) .cse5)))) (< 4294967295 v_z_30) (< v_z_30 .cse3))) (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse13 (+ .cse9 v_z_78)) (.cse12 (+ v_z_78 (* v_y_78 4294967296)))) (or (< (mod (div v_z_30 .cse12) 4294967296) .cse5) (= .cse13 .cse7) (< .cse12 0) (< 4294967295 .cse13) (< 65535 .cse12) (< v_z_78 0)))) (< v_z_30 .cse3))))) (or .cse14 (forall ((v_z_63 Int) (v_y_63 Int) (v_z_33 Int)) (let ((.cse15 (+ (* v_y_63 4294967296) v_z_63))) (or (< 4294967295 v_z_33) (< (mod (div v_z_33 .cse15) 4294967296) .cse16) (< v_z_33 .cse3) (= 4294967424 (+ .cse9 v_z_63)) (< v_z_63 0) (< .cse15 0) (< 65535 .cse15) (< 4294967295 v_z_63)))) .cse17 .cse18) (or (forall ((v_y_57 Int) (v_z_57 Int) (v_z_34 Int)) (let ((.cse19 (+ (* v_y_57 4294967296) v_z_57))) (or (< 4294967295 v_z_34) (< (mod (div v_z_34 .cse19) 4294967296) .cse16) (< v_z_34 .cse3) (< 65535 .cse19) (< 4294967295 v_z_57) (< .cse19 0) (= 4294967424 (+ .cse9 v_z_57)) (< v_z_57 0)))) .cse14 .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_34 Int)) (or (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (+ (* v_y_72 4294967296) v_z_72)) (.cse20 (+ .cse9 v_z_72))) (or (< .cse20 4294967296) (< 4294967295 v_z_72) (< (div v_z_34 .cse21) .cse5) (< 65535 .cse21) (= .cse20 .cse8)))) (< 4294967295 v_z_34) (< v_z_34 .cse3))) (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse3) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse23 (+ (* v_y_72 4294967296) v_z_72)) (.cse22 (+ .cse9 v_z_72))) (or (< v_z_72 0) (< 4294967295 .cse22) (< (mod (div v_z_34 .cse23) 4294967296) .cse5) (< 65535 .cse23) (< .cse23 0) (= .cse22 .cse7)))))) (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse3) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse24 (+ (* v_y_72 4294967296) v_z_72)) (.cse25 (+ .cse9 v_z_72))) (or (< v_z_72 0) (< (mod (div v_z_34 .cse24) 4294967296) .cse5) (< 4294967295 v_z_72) (< 65535 .cse24) (= .cse25 .cse8) (< .cse24 0) (= .cse25 .cse7)))))))) (or .cse0 .cse1 .cse2 (and (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse27 (+ v_z_81 (* v_y_81 4294967296))) (.cse26 (+ .cse9 v_z_81))) (or (< 4294967295 .cse26) (< v_z_81 0) (< .cse27 0) (< (mod (div .cse28 .cse27) 4294967296) .cse5) (= .cse26 .cse7)))) (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse30 (+ v_z_81 (* v_y_81 4294967296))) (.cse29 (+ .cse9 v_z_81))) (or (< v_z_81 0) (< 4294967295 v_z_81) (= .cse29 .cse8) (< .cse30 0) (< (mod (div .cse28 .cse30) 4294967296) .cse5) (= .cse29 .cse7)))) (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse31 (+ .cse9 v_z_81))) (or (< (div .cse28 (+ v_z_81 (* v_y_81 4294967296))) .cse5) (< 4294967295 v_z_81) (= .cse31 .cse8) (< .cse31 4294967296)))))) (or (forall ((v_z_69 Int) (v_y_69 Int) (v_z_28 Int)) (let ((.cse32 (+ (* v_y_69 4294967296) v_z_69))) (or (< .cse32 0) (< (mod (div v_z_28 .cse32) 4294967296) .cse16) (< 65535 .cse32) (< v_z_28 .cse3) (= 4294967424 (+ .cse9 v_z_69)) (< v_z_69 0) (< 4294967295 v_z_69) (< 4294967295 v_z_28)))) .cse14 .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_29 Int)) (or (< v_z_29 .cse3) (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse33 (+ .cse9 v_z_75)) (.cse34 (+ v_z_75 (* v_y_75 4294967296)))) (or (< 4294967295 v_z_75) (= .cse33 .cse8) (< (div v_z_29 .cse34) .cse5) (< .cse33 4294967296) (< 65535 .cse34)))) (< 4294967295 v_z_29))) (forall ((v_z_29 Int)) (or (< v_z_29 .cse3) (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse35 (+ v_z_75 (* v_y_75 4294967296))) (.cse36 (+ .cse9 v_z_75))) (or (< v_z_75 0) (< 65535 .cse35) (= .cse7 .cse36) (< .cse35 0) (< (mod (div v_z_29 .cse35) 4294967296) .cse5) (< 4294967295 .cse36)))) (< 4294967295 v_z_29))) (forall ((v_z_29 Int)) (or (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse37 (+ .cse9 v_z_75)) (.cse38 (+ v_z_75 (* v_y_75 4294967296)))) (or (< 4294967295 v_z_75) (= .cse37 .cse8) (< v_z_75 0) (< 65535 .cse38) (= .cse7 .cse37) (< .cse38 0) (< (mod (div v_z_29 .cse38) 4294967296) .cse5)))) (< v_z_29 .cse3) (< 4294967295 v_z_29))))) (or .cse14 .cse17 (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse39 (+ v_z_48 (* v_y_48 4294967296)))) (or (< v_z_48 0) (< .cse39 0) (< 4294967295 v_z_48) (< (mod (div .cse28 .cse39) 4294967296) .cse16)))) .cse18) (or (forall ((v_z_30 Int) (v_z_66 Int) (v_y_66 Int)) (let ((.cse40 (+ v_z_66 (* v_y_66 4294967296)))) (or (< (mod (div v_z_30 .cse40) 4294967296) .cse16) (< v_z_66 0) (< 4294967295 v_z_30) (= 4294967424 (+ .cse9 v_z_66)) (< 65535 .cse40) (< 4294967295 v_z_66) (< .cse40 0) (< v_z_30 .cse3)))) .cse14 .cse17 .cse18) (or .cse14 (forall ((v_z_29 Int) (v_z_42 Int) (v_y_42 Int)) (let ((.cse41 (+ v_z_42 (* v_y_42 4294967296)))) (or (< .cse41 0) (< 4294967295 v_z_42) (= 4294967424 (+ .cse9 v_z_42)) (< v_z_29 .cse3) (< v_z_42 0) (< (mod (div v_z_29 .cse41) 4294967296) .cse16) (< 65535 .cse41) (< 4294967295 v_z_29)))) .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse42 (+ .cse9 v_z_51)) (.cse43 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse7 .cse42) (= .cse42 .cse8) (< .cse43 0) (< (mod (div v_z_32 .cse43) 4294967296) .cse5) (< v_z_51 0) (< 4294967295 v_z_51) (< 65535 .cse43)))) (< v_z_32 .cse3))) (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse44 (+ .cse9 v_z_51)) (.cse45 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse7 .cse44) (< .cse45 0) (< (mod (div v_z_32 .cse45) 4294967296) .cse5) (< 4294967295 .cse44) (< v_z_51 0) (< 65535 .cse45)))) (< v_z_32 .cse3))) (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse3) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse46 (+ .cse9 v_z_51)) (.cse47 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse46 .cse8) (< (div v_z_32 .cse47) .cse5) (< .cse46 4294967296) (< 4294967295 v_z_51) (< 65535 .cse47)))))))) (or .cse0 .cse1 (and (forall ((v_z_28 Int)) (or (< v_z_28 .cse3) (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse48 (+ v_z_60 (* v_y_60 4294967296))) (.cse49 (+ .cse9 v_z_60))) (or (< .cse48 0) (= .cse49 .cse7) (< 65535 .cse48) (< v_z_60 0) (< (mod (div v_z_28 .cse48) 4294967296) .cse5) (< 4294967295 .cse49)))) (< 4294967295 v_z_28))) (forall ((v_z_28 Int)) (or (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse50 (+ v_z_60 (* v_y_60 4294967296))) (.cse51 (+ .cse9 v_z_60))) (or (< .cse50 0) (= .cse51 .cse7) (< 4294967295 v_z_60) (< 65535 .cse50) (< v_z_60 0) (< (mod (div v_z_28 .cse50) 4294967296) .cse5) (= .cse51 .cse8)))) (< v_z_28 .cse3) (< 4294967295 v_z_28))) (forall ((v_z_28 Int)) (or (< v_z_28 .cse3) (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse52 (+ v_z_60 (* v_y_60 4294967296))) (.cse53 (+ .cse9 v_z_60))) (or (< 4294967295 v_z_60) (< 65535 .cse52) (< (div v_z_28 .cse52) .cse5) (< .cse53 4294967296) (= .cse53 .cse8)))) (< 4294967295 v_z_28)))) .cse2) (or .cse0 (and (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse54 (+ v_z_54 (* v_y_54 4294967296))) (.cse55 (+ .cse9 v_z_54))) (or (< 65535 .cse54) (< 4294967295 v_z_54) (< .cse55 4294967296) (< (div v_z_33 .cse54) .cse5) (= .cse55 .cse8)))))) (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse56 (+ v_z_54 (* v_y_54 4294967296))) (.cse57 (+ .cse9 v_z_54))) (or (< 65535 .cse56) (< 4294967295 v_z_54) (< (mod (div v_z_33 .cse56) 4294967296) .cse5) (< .cse56 0) (< v_z_54 0) (= .cse57 .cse7) (= .cse57 .cse8)))))) (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse58 (+ v_z_54 (* v_y_54 4294967296))) (.cse59 (+ .cse9 v_z_54))) (or (< 65535 .cse58) (< (mod (div v_z_33 .cse58) 4294967296) .cse5) (< .cse58 0) (< v_z_54 0) (= .cse59 .cse7) (< 4294967295 .cse59))))))) .cse1 .cse2) (or (forall ((v_y_45 Int) (v_z_32 Int) (v_z_45 Int)) (let ((.cse60 (+ v_z_45 (* v_y_45 4294967296)))) (or (< v_z_45 0) (< 4294967295 v_z_32) (= 4294967424 (+ .cse9 v_z_45)) (< 4294967295 v_z_45) (< v_z_32 .cse3) (< (mod (div v_z_32 .cse60) 4294967296) .cse16) (< .cse60 0) (< 65535 .cse60)))) .cse14 .cse17 .cse18))))) is different from false [2024-11-28 05:11:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:11:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081460438] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:30,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:11:30,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 25 [2024-11-28 05:11:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387729040] [2024-11-28 05:11:30,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:30,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:11:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:30,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:11:30,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=411, Unknown=15, NotChecked=86, Total=600 [2024-11-28 05:11:30,872 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:11:36,788 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-28 05:11:40,794 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-28 05:11:44,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:11:48,100 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-28 05:11:52,123 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-28 05:11:56,146 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-28 05:11:58,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:00,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:02,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:04,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:08,765 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-28 05:12:12,982 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-28 05:12:17,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:19,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:25,373 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-28 05:12:30,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (mod c_~last_1_var_1_18~0 4294967296)) (.cse44 (mod c_~last_1_var_1_6~0 65536)) (.cse1 (mod c_~var_1_4~0 65536)) (.cse35 (mod c_~var_1_1~0 4294967296))) (let ((.cse19 (= 1000000000 .cse35)) (.cse43 (mod (div .cse44 .cse1) 4294967296)) (.cse41 (+ .cse25 1)) (.cse42 (mod c_~var_1_6~0 65536)) (.cse20 (= c_~last_1_var_1_18~0 .cse44)) (.cse9 (= .cse35 128))) (let ((.cse3 (not .cse9)) (.cse2 (+ c_~last_1_var_1_18~0 1)) (.cse4 (not .cse20)) (.cse33 (mod (+ (* .cse42 c_~var_1_7~0) (* .cse42 .cse42)) 4294967296)) (.cse23 (mod c_~var_1_12~0 256)) (.cse40 (< .cse43 .cse41)) (.cse11 (and .cse19 .cse20)) (.cse0 (+ .cse44 1))) (let ((.cse10 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< (mod (div v_z_30 .cse1) 4294967296) .cse41) (< v_z_30 .cse0)))) (.cse8 (or .cse9 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse0) (< (mod (div v_z_32 .cse1) 4294967296) .cse41))) .cse11)) (.cse31 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse0) (< (mod (div v_z_33 .cse1) 4294967296) .cse41)))) (.cse16 (or .cse11 .cse40)) (.cse13 (= .cse23 1)) (.cse15 (<= .cse33 .cse35)) (.cse21 (<= .cse33 1000000000)) (.cse5 (or (< .cse43 .cse2) .cse4)) (.cse6 (<= .cse33 128)) (.cse17 (= (mod c_~var_1_13~0 256) 0)) (.cse7 (= .cse42 (mod c_~var_1_11~0 65536))) (.cse12 (or .cse3 .cse4 (forall ((v_z_29 Int)) (or (< (mod (div v_z_29 .cse1) 4294967296) .cse2) (< v_z_29 .cse0) (< 4294967295 v_z_29))))) (.cse36 (or .cse9 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse1) 4294967296) .cse41) (< v_z_28 .cse0) (< 4294967295 v_z_28))) .cse11)) (.cse37 (or .cse9 (forall ((v_z_29 Int)) (or (< v_z_29 .cse0) (< (mod (div v_z_29 .cse1) 4294967296) .cse41) (< 4294967295 v_z_29))) .cse11)) (.cse38 (or .cse3 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse1) 4294967296) .cse2) (< v_z_28 .cse0) (< 4294967295 v_z_28))) .cse4)) (.cse24 (mod c_~var_1_17~0 256)) (.cse29 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< (mod (div v_z_34 .cse1) 4294967296) .cse41)))) (.cse22 (or .cse3 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse0) (< (mod (div v_z_32 .cse1) 4294967296) .cse2))) .cse4))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< (mod (div v_z_34 .cse1) 4294967296) .cse2))) .cse3 .cse4) (or .cse3 (and .cse5 .cse6 .cse7)) .cse8 (or .cse3 .cse4 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< (mod (div v_z_33 .cse1) 4294967296) .cse2) (< v_z_33 .cse0)))) (or .cse9 .cse10 .cse11) .cse12 (or .cse13 (let ((.cse26 (= .cse23 0))) (and (or (let ((.cse18 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< .cse25 (mod (div v_z_30 .cse1) 4294967296)) (< v_z_30 .cse0)))) (.cse14 (= .cse23 .cse24))) (and (or .cse9 (and .cse14 .cse7 .cse15 .cse16)) (or .cse9 (and .cse17 (or (and .cse14 .cse7 .cse15) .cse18) (or .cse10 (and .cse19 .cse14 .cse20 .cse7 .cse21)))) (or .cse3 (and .cse17 (or .cse10 (and .cse6 .cse14 .cse7 .cse4)) (or (and .cse6 .cse14 .cse7) .cse18))) .cse8 (or .cse3 (and .cse5 .cse6 .cse14 .cse7)) .cse22)) .cse26) (or (not .cse26) (let ((.cse32 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< .cse25 (mod (div v_z_33 .cse1) 4294967296)) (< v_z_33 .cse0)))) (.cse30 (mod (+ .cse1 (* c_~var_1_1~0 4294967295)) 4294967296)) (.cse34 (not .cse19)) (.cse27 (= .cse24 0))) (and (or .cse9 (and .cse7 .cse16)) (or .cse3 (and .cse5 .cse6 .cse7 .cse27)) (or .cse3 (let ((.cse28 (or (= .cse30 128) .cse7))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< .cse25 (mod (div v_z_34 .cse1) 4294967296)))) (and .cse6 .cse27 .cse28)) (or .cse29 (and .cse6 .cse27 .cse4 .cse28))))) (or .cse3 (and (or .cse31 (and .cse6 .cse7 .cse27 .cse4)) .cse17 (or .cse32 (and .cse6 .cse7 .cse27)))) (or (and (or (and (or (< .cse33 1000000001) .cse34) .cse7 .cse15 .cse27) .cse32) .cse17 (or .cse31 (and .cse19 .cse20 .cse7 .cse27 .cse21))) .cse9) (or .cse9 (and (or .cse7 (= .cse30 .cse35)) (or (and .cse7 .cse21) .cse34) .cse15 .cse27 (or .cse29 (and .cse19 .cse20 .cse7 .cse21)))))))))) .cse36 (or .cse9 .cse31 .cse11) .cse37 (or .cse3 (forall ((v_z_30 Int)) (or (< (mod (div v_z_30 .cse1) 4294967296) .cse2) (< 4294967295 v_z_30) (< v_z_30 .cse0))) .cse4) .cse38 (or .cse9 (and .cse7 .cse15 .cse16)) (or (not .cse13) (let ((.cse39 (= .cse24 1))) (and (or .cse9 (and .cse39 .cse17 .cse7 .cse15 (or (and .cse19 .cse20 .cse21) .cse40))) (or .cse3 (and .cse5 .cse6 .cse39 .cse17 .cse7)) .cse12 .cse36 .cse37 .cse38))) (or .cse9 .cse29 .cse11) .cse22))))) is different from false [2024-11-28 05:12:34,346 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-28 05:12:38,459 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-28 05:12:43,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:44,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:12:49,217 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-28 05:12:53,583 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-28 05:12:57,844 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-28 05:13:02,681 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-28 05:13:07,409 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-28 05:13:11,828 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-28 05:13:15,852 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-28 05:13:19,940 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-28 05:13:23,995 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-28 05:13:28,003 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-28 05:13:32,022 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-28 05:13:36,045 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-28 05:13:40,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:13:44,586 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-28 05:13:48,594 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-28 05:13:49,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-28 05:13:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:13:49,642 INFO L93 Difference]: Finished difference Result 173 states and 246 transitions. [2024-11-28 05:13:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:13:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-28 05:13:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:13:49,648 INFO L225 Difference]: With dead ends: 173 [2024-11-28 05:13:49,648 INFO L226 Difference]: Without dead ends: 171 [2024-11-28 05:13:49,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 102.2s TimeCoverageRelationStatistics Valid=90, Invalid=412, Unknown=16, NotChecked=132, Total=650 [2024-11-28 05:13:49,649 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 133.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:13:49,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 512 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 27 Unknown, 112 Unchecked, 133.7s Time] [2024-11-28 05:13:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-28 05:13:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2024-11-28 05:13:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:13:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-28 05:13:49,707 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-28 05:13:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:13:49,708 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-28 05:13:49,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:13:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-28 05:13:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 05:13:49,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:13:49,711 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:49,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:13:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0bfd4a-ee53-49d6-b5a7-bc389cc8967d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 05:13:49,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:13:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1945584703, now seen corresponding path program 1 times [2024-11-28 05:13:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417297609] [2024-11-28 05:13:49,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:14:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:10,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417297609] [2024-11-28 05:14:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417297609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:10,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:10,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:14:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958933919] [2024-11-28 05:14:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:10,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:14:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:10,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:14:10,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:14:10,618 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:14:29,177 WARN L286 SmtUtils]: Spent 11.14s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:14:32,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:14:36,420 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 [] [2024-11-28 05:14:40,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 05:14:44,324 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 [] [2024-11-28 05:14:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:51,534 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2024-11-28 05:14:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:14:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-28 05:14:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:51,537 INFO L225 Difference]: With dead ends: 171 [2024-11-28 05:14:51,537 INFO L226 Difference]: Without dead ends: 169 [2024-11-28 05:14:51,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:14:51,537 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 26 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:51,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 412 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 17.0s Time] [2024-11-28 05:14:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-28 05:14:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-28 05:14:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 82 states have (on average 1.170731707317073) internal successors, (96), 82 states have internal predecessors, (96), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 05:14:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-28 05:14:51,573 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 234 [2024-11-28 05:14:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:51,573 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-28 05:14:51,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:14:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-28 05:14:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 05:14:51,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:51,575 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:14:51,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:14:51,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1484624707, now seen corresponding path program 1 times [2024-11-28 05:14:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507179757] [2024-11-28 05:14:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-11-28 05:14:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507179757] [2024-11-28 05:14:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507179757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:14:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093368486] [2024-11-28 05:14:52,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:14:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:52,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:14:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:52,748 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-28 05:14:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:55,005 INFO L93 Difference]: Finished difference Result 452 states and 634 transitions. [2024-11-28 05:14:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:14:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 234 [2024-11-28 05:14:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:55,010 INFO L225 Difference]: With dead ends: 452 [2024-11-28 05:14:55,010 INFO L226 Difference]: Without dead ends: 352 [2024-11-28 05:14:55,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:14:55,011 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 163 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:55,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 476 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:14:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-28 05:14:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 290. [2024-11-28 05:14:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 168 states have (on average 1.1666666666666667) internal successors, (196), 170 states have internal predecessors, (196), 109 states have call successors, (109), 12 states have call predecessors, (109), 12 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-28 05:14:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-11-28 05:14:55,103 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 234 [2024-11-28 05:14:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-11-28 05:14:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-28 05:14:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-11-28 05:14:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 05:14:55,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:55,107 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:55,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:14:55,107 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:14:55,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash -565784191, now seen corresponding path program 1 times [2024-11-28 05:14:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103002551] [2024-11-28 05:14:55,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-28 05:15:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103002551] [2024-11-28 05:15:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103002551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:15:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600508602] [2024-11-28 05:15:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:31,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:15:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:31,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:15:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:15:31,890 INFO L87 Difference]: Start difference. First operand 290 states and 414 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-28 05:15:37,032 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 [] [2024-11-28 05:15:41,468 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 [] [2024-11-28 05:15:45,494 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 [] [2024-11-28 05:15:48,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []