./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX --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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:28:11,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:28:11,650 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:28:11,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:28:11,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:28:11,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:28:11,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:28:11,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:28:11,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:28:11,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:28:11,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:28:11,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:28:11,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:28:11,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:28:11,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:28:11,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:28:11,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:28:11,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:28:11,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:28:11,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:28:11,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:28:11,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:28:11,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:28:11,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:28:11,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:28:11,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:28:11,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:28:11,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:28:11,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:28:11,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:28:11,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:28:11,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:28:11,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:28:11,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:28:11,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:28:11,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:28:11,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:28:11,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:28:11,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:28:11,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:28:11,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:28:11,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:28:11,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2024-11-08 16:28:12,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:28:12,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:28:12,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:28:12,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:28:12,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:28:12,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i Unable to find full path for "g++" [2024-11-08 16:28:14,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:28:14,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:28:14,922 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-11-08 16:28:14,933 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/e05b34138/02e3c4301218443a8a4a539958c75dbc/FLAG580e242d3 [2024-11-08 16:28:14,963 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/e05b34138/02e3c4301218443a8a4a539958c75dbc [2024-11-08 16:28:14,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:28:14,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:28:14,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:28:14,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:28:14,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:28:14,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:28:14" (1/1) ... [2024-11-08 16:28:14,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72799771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:14, skipping insertion in model container [2024-11-08 16:28:14,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:28:14" (1/1) ... [2024-11-08 16:28:15,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:28:15,301 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_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2024-11-08 16:28:15,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:28:15,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:28:15,447 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_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2024-11-08 16:28:15,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:28:15,531 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:28:15,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15 WrapperNode [2024-11-08 16:28:15,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:28:15,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:28:15,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:28:15,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:28:15,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,631 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-08 16:28:15,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:28:15,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:28:15,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:28:15,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:28:15,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,691 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-08 16:28:15,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:28:15,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:28:15,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:28:15,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:28:15,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (1/1) ... [2024-11-08 16:28:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:28:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:28:15,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:28:15,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:28:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:28:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:28:15,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:28:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:28:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:28:15,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:28:15,936 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:28:15,939 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:28:16,507 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 16:28:16,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:28:16,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:28:16,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:28:16,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:28:16 BoogieIcfgContainer [2024-11-08 16:28:16,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:28:16,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:28:16,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:28:16,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:28:16,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:28:14" (1/3) ... [2024-11-08 16:28:16,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d434e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:28:16, skipping insertion in model container [2024-11-08 16:28:16,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:28:15" (2/3) ... [2024-11-08 16:28:16,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d434e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:28:16, skipping insertion in model container [2024-11-08 16:28:16,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:28:16" (3/3) ... [2024-11-08 16:28:16,535 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2024-11-08 16:28:16,558 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:28:16,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:28:16,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:28:16,708 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;@77d441a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:28:16,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:28:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 16:28:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:28:16,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:16,763 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:28:16,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1941911435, now seen corresponding path program 1 times [2024-11-08 16:28:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150103115] [2024-11-08 16:28:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:28:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:28:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 16:28:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:28:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:28:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:28:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:28:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:28:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:28:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 16:28:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 16:28:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 16:28:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 16:28:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:28:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:28:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150103115] [2024-11-08 16:28:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150103115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:28:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511944471] [2024-11-08 16:28:17,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:28:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:28:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:28:17,457 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 16:28:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:17,502 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-08 16:28:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:28:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-08 16:28:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:17,517 INFO L225 Difference]: With dead ends: 97 [2024-11-08 16:28:17,518 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 16:28:17,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-08 16:28:17,529 INFO L432 NwaCegarLoop]: 71 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, 71 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-08 16:28:17,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:28:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 16:28:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 16:28:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 16:28:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-08 16:28:17,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2024-11-08 16:28:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:17,595 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-08 16:28:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 16:28:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-08 16:28:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:28:17,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:17,600 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:28:17,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:28:17,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2058187331, now seen corresponding path program 1 times [2024-11-08 16:28:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747109877] [2024-11-08 16:28:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:28:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:28:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 16:28:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:28:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:28:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:28:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:28:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:28:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:28:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 16:28:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 16:28:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 16:28:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 16:28:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:28:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:28:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747109877] [2024-11-08 16:28:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747109877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:18,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:28:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907791521] [2024-11-08 16:28:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:18,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:28:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:28:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:28:18,491 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:28:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:18,712 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-08 16:28:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:28:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-08 16:28:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:18,717 INFO L225 Difference]: With dead ends: 139 [2024-11-08 16:28:18,717 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 16:28:18,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:28:18,720 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:18,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:28:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 16:28:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-08 16:28:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:28:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-11-08 16:28:18,746 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2024-11-08 16:28:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:18,747 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-11-08 16:28:18,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:28:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-11-08 16:28:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 16:28:18,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:18,751 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:28:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:28:18,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:18,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -637560736, now seen corresponding path program 1 times [2024-11-08 16:28:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653839185] [2024-11-08 16:28:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:28:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:28:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 16:28:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:28:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:28:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:28:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:28:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:28:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:28:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 16:28:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 16:28:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 16:28:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 16:28:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:28:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:28:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653839185] [2024-11-08 16:28:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653839185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:28:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055193684] [2024-11-08 16:28:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:28:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:28:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:28:19,355 INFO L87 Difference]: Start difference. First operand 77 states and 113 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:28:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:19,630 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2024-11-08 16:28:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:28:19,631 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-08 16:28:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:19,634 INFO L225 Difference]: With dead ends: 176 [2024-11-08 16:28:19,635 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:28:19,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:28:19,637 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:19,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 253 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:28:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:28:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2024-11-08 16:28:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:28:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-11-08 16:28:19,691 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2024-11-08 16:28:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-11-08 16:28:19,692 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:28:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-11-08 16:28:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 16:28:19,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:19,695 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:28:19,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:28:19,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:19,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223849, now seen corresponding path program 1 times [2024-11-08 16:28:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585484309] [2024-11-08 16:28:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:28:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299615007] [2024-11-08 16:28:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:19,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:28:19,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:28:19,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:28:19,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:28:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:20,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 16:28:20,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 16:28:23,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:28:37,406 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:28:49,214 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:29:02,860 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:29:09,623 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:29:25,646 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:29:29,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod c_~var_1_17~0 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse3) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse4 v_z_5) (< v_z_5 .cse1))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2024-11-08 16:29:42,600 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:29:52,821 WARN L286 SmtUtils]: Spent 10.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:30:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:30:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585484309] [2024-11-08 16:30:22,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:30:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299615007] [2024-11-08 16:30:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299615007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:30:22,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:30:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2024-11-08 16:30:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821871745] [2024-11-08 16:30:22,172 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 16:30:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:30:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:30:22,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:30:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=507, Unknown=2, NotChecked=50, Total=756 [2024-11-08 16:30:22,174 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-08 16:30:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:25,547 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2024-11-08 16:30:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 16:30:25,548 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 95 [2024-11-08 16:30:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:25,550 INFO L225 Difference]: With dead ends: 299 [2024-11-08 16:30:25,551 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 16:30:25,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=313, Invalid=811, Unknown=2, NotChecked=64, Total=1190 [2024-11-08 16:30:25,553 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 115 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:30:25,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 208 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:30:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 16:30:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2024-11-08 16:30:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.134453781512605) internal successors, (135), 119 states have internal predecessors, (135), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:30:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2024-11-08 16:30:25,591 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 95 [2024-11-08 16:30:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:30:25,592 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2024-11-08 16:30:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-08 16:30:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2024-11-08 16:30:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 16:30:25,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:25,595 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:30:25,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:30:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 16:30:25,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 840206067, now seen corresponding path program 1 times [2024-11-08 16:30:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:30:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843479988] [2024-11-08 16:30:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:30:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:30:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023440588] [2024-11-08 16:30:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:25,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:30:25,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:30:25,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:30:25,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:30:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:30:26,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:30:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:30:26,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:30:26,666 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:30:26,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:30:26,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:30:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:30:26,876 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 16:30:27,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:30:27,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:30:27 BoogieIcfgContainer [2024-11-08 16:30:27,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:30:27,007 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:30:27,007 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:30:27,007 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:30:27,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:28:16" (3/4) ... [2024-11-08 16:30:27,011 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:30:27,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:30:27,012 INFO L158 Benchmark]: Toolchain (without parser) took 132042.35ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 109.9MB in the beginning and 177.2MB in the end (delta: -67.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,012 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 140.5MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 183.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:30:27,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.69ms. Allocated memory is still 140.5MB. Free memory was 109.7MB in the beginning and 94.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.61ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 90.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,013 INFO L158 Benchmark]: Boogie Preprocessor took 99.79ms. Allocated memory is still 140.5MB. Free memory was 90.3MB in the beginning and 83.8MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,014 INFO L158 Benchmark]: RCFGBuilder took 787.98ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 62.6MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,014 INFO L158 Benchmark]: TraceAbstraction took 130480.01ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 62.0MB in the beginning and 177.2MB in the end (delta: -115.2MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-11-08 16:30:27,014 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 211.8MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:30:27,016 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 140.5MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 183.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.69ms. Allocated memory is still 140.5MB. Free memory was 109.7MB in the beginning and 94.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.61ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 90.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.79ms. Allocated memory is still 140.5MB. Free memory was 90.3MB in the beginning and 83.8MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 787.98ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 62.6MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 130480.01ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 62.0MB in the beginning and 177.2MB in the end (delta: -115.2MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 211.8MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_4 = 25; [L24] unsigned short int var_1_5 = 0; [L25] unsigned short int var_1_6 = 62100; [L26] unsigned short int var_1_7 = 27651; [L27] double var_1_8 = 128.9; [L28] double var_1_10 = 16.5; [L29] double var_1_11 = 25.5; [L30] double var_1_12 = 199.75; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 1; [L35] unsigned short int var_1_17 = 32; [L36] unsigned char var_1_18 = 1; [L37] unsigned long int var_1_19 = 1; [L38] unsigned short int last_1_var_1_5 = 0; [L39] unsigned char last_1_var_1_15 = 1; [L40] unsigned char last_1_var_1_18 = 1; [L41] unsigned long int last_1_var_1_19 = 1; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_5 = var_1_5 [L118] last_1_var_1_15 = var_1_15 [L119] last_1_var_1_18 = var_1_18 [L120] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L97] var_1_6 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L99] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L99] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=27651, var_1_8=1289/10] [L100] var_1_7 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L101] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L102] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L102] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L103] var_1_10 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L104] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L105] var_1_11 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L107] var_1_12 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L109] var_1_14 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L110] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L111] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L111] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L113] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L114] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L114] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE \read(last_1_var_1_18) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=1289/10] [L46] COND TRUE (! last_1_var_1_15) || (last_1_var_1_19 < var_1_6) [L47] var_1_8 = ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L54] COND TRUE var_1_12 != var_1_8 [L55] var_1_15 = (! var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L59] var_1_17 = var_1_4 [L60] var_1_18 = var_1_16 [L61] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L62] COND FALSE !((var_1_17 != (16 / var_1_4)) && var_1_15) [L73] var_1_1 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L75] COND FALSE !(var_1_17 < last_1_var_1_5) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L78] COND TRUE ! var_1_15 [L79] var_1_5 = ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L82] COND TRUE var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L83] COND TRUE var_1_5 <= var_1_6 [L84] var_1_13 = 32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_17 != (16 / var_1_4)) && var_1_15) ? ((var_1_17 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_17))) : (var_1_15 ? (var_1_1 == ((unsigned short int) var_1_17)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_17))) && ((var_1_17 < last_1_var_1_5) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - last_1_var_1_5)))) : ((! var_1_15) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))))) : 1))) && (last_1_var_1_18 ? (((! last_1_var_1_15) || (last_1_var_1_19 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19))))) ? ((var_1_5 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=1, var_1_5=16647, var_1_6=-294904, var_1_7=16646, var_1_8=509/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 729 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 261 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 123.2s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 2151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1351/1456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:30:27,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX --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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:30:29,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:30:29,455 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:30:29,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:30:29,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:30:29,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:30:29,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:30:29,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:30:29,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:30:29,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:30:29,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:30:29,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:30:29,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:30:29,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:30:29,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:30:29,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:30:29,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:30:29,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:30:29,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:30:29,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:30:29,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:30:29,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:30:29,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:30:29,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:30:29,517 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:30:29,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:30:29,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:30:29,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:30:29,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:30:29,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:30:29,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:30:29,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:30:29,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:30:29,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:30:29,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:30:29,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:30:29,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:30:29,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:30:29,521 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:30:29,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:30:29,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:30:29,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:30:29,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:30:29,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:30:29,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2024-11-08 16:30:29,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:30:29,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:30:29,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:30:29,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:30:29,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:30:29,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i Unable to find full path for "g++" [2024-11-08 16:30:32,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:30:32,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:30:32,323 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-11-08 16:30:32,335 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/871623329/9172e8b325d7456d852085f656ef5f75/FLAG7bdff6afe [2024-11-08 16:30:32,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/data/871623329/9172e8b325d7456d852085f656ef5f75 [2024-11-08 16:30:32,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:30:32,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:30:32,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:30:32,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:30:32,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:30:32,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:30:32" (1/1) ... [2024-11-08 16:30:32,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dde7cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:32, skipping insertion in model container [2024-11-08 16:30:32,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:30:32" (1/1) ... [2024-11-08 16:30:32,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:30:32,992 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_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2024-11-08 16:30:33,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:30:33,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:30:33,132 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_b4e54c62-e8a0-4b3b-850b-12afda863e02/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2024-11-08 16:30:33,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:30:33,221 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:30:33,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33 WrapperNode [2024-11-08 16:30:33,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:30:33,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:30:33,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:30:33,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:30:33,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,323 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-08 16:30:33,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:30:33,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:30:33,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:30:33,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:30:33,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,367 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-08 16:30:33,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:30:33,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:30:33,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:30:33,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:30:33,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (1/1) ... [2024-11-08 16:30:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:30:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:30:33,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:30:33,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:30:33,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:30:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:30:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:30:33,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:30:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:30:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:30:33,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:30:33,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:30:34,730 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 16:30:34,731 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:30:34,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:30:34,757 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:30:34,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:30:34 BoogieIcfgContainer [2024-11-08 16:30:34,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:30:34,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:30:34,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:30:34,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:30:34,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:30:32" (1/3) ... [2024-11-08 16:30:34,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf4f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:30:34, skipping insertion in model container [2024-11-08 16:30:34,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:33" (2/3) ... [2024-11-08 16:30:34,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf4f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:30:34, skipping insertion in model container [2024-11-08 16:30:34,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:30:34" (3/3) ... [2024-11-08 16:30:34,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2024-11-08 16:30:34,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:30:34,808 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:30:34,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:30:34,937 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;@2b11bd8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:30:34,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:30:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 16:30:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:30:34,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:34,963 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:30:34,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1941911435, now seen corresponding path program 1 times [2024-11-08 16:30:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:30:34,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875023381] [2024-11-08 16:30:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:34,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:34,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:30:34,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:30:35,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:30:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:35,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:30:35,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:30:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-08 16:30:35,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:30:35,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:30:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875023381] [2024-11-08 16:30:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875023381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:30:35,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:30:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:30:35,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232379136] [2024-11-08 16:30:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:30:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:30:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:30:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:30:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:30:35,530 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:35,577 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-08 16:30:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:30:35,583 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-08 16:30:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:35,592 INFO L225 Difference]: With dead ends: 97 [2024-11-08 16:30:35,593 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 16:30:35,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-08 16:30:35,602 INFO L432 NwaCegarLoop]: 71 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, 71 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-08 16:30:35,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:30:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 16:30:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 16:30:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 16:30:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-08 16:30:35,665 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2024-11-08 16:30:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:30:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-08 16:30:35,667 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-08 16:30:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:30:35,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:35,675 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:30:35,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:30:35,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:35,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2058187331, now seen corresponding path program 1 times [2024-11-08 16:30:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:30:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982272591] [2024-11-08 16:30:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:35,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:30:35,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:30:35,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:30:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:36,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:30:36,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:30:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:30:36,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:30:36,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:30:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982272591] [2024-11-08 16:30:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982272591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:30:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:30:36,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:30:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048621015] [2024-11-08 16:30:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:30:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:30:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:30:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:30:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:30:36,769 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:37,644 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-08 16:30:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:30:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-08 16:30:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:37,658 INFO L225 Difference]: With dead ends: 139 [2024-11-08 16:30:37,658 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 16:30:37,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:30:37,660 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:30:37,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 197 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:30:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 16:30:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-08 16:30:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:30:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-11-08 16:30:37,691 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2024-11-08 16:30:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:30:37,693 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-11-08 16:30:37,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-11-08 16:30:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 16:30:37,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:37,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:30:37,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:30:37,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:37,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:37,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash -637560736, now seen corresponding path program 1 times [2024-11-08 16:30:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:30:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99415838] [2024-11-08 16:30:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:37,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:30:37,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:30:37,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:30:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:38,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:30:38,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:30:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:30:38,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:30:38,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:30:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99415838] [2024-11-08 16:30:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99415838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:30:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:30:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:30:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333877242] [2024-11-08 16:30:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:30:38,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:30:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:30:38,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:30:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:30:38,785 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:40,235 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2024-11-08 16:30:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:30:40,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-08 16:30:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:40,247 INFO L225 Difference]: With dead ends: 176 [2024-11-08 16:30:40,247 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:30:40,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:30:40,253 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:30:40,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 16:30:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:30:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2024-11-08 16:30:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:30:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-11-08 16:30:40,332 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2024-11-08 16:30:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:30:40,333 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-11-08 16:30:40,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 16:30:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-11-08 16:30:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 16:30:40,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:40,340 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:30:40,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:30:40,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:40,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:40,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223849, now seen corresponding path program 1 times [2024-11-08 16:30:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:30:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580093515] [2024-11-08 16:30:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:30:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:30:40,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:30:40,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:30:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:40,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 16:30:40,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:30:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 16:30:44,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:31:51,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:31:51,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580093515] [2024-11-08 16:31:51,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580093515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:31:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999953002] [2024-11-08 16:31:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:31:51,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:31:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:31:51,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:31:51,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4e54c62-e8a0-4b3b-850b-12afda863e02/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:31:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:31:51,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:31:51,848 INFO L278 TraceCheckSpWp]: Computing forward predicates...