./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU --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 c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:40,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:41,025 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:41,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:41,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:41,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:41,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:41,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:41,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:41,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:41,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:41,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:41,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:41,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:41,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:41,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:41,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:41,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:41,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:41,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:41,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:41,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:41,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:41,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:41,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:41,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:41,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:41,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:41,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:41,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:41,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:41,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:41,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:41,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:41,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:41,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:41,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:41,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:41,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:41,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:41,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:41,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:41,107 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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU 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 -> c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 [2024-10-31 21:57:41,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:41,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:41,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:41,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:41,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:41,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i Unable to find full path for "g++" [2024-10-31 21:57:43,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:43,768 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:43,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i [2024-10-31 21:57:43,779 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/24e91dac4/9b40a085bbea44408ea1bc4a1b4cddc4/FLAG69d3694b9 [2024-10-31 21:57:44,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/24e91dac4/9b40a085bbea44408ea1bc4a1b4cddc4 [2024-10-31 21:57:44,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:44,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:44,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:44,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:44,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:44,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7292b35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44, skipping insertion in model container [2024-10-31 21:57:44,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:44,366 WARN L251 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_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i[919,932] [2024-10-31 21:57:44,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:44,450 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:44,468 WARN L251 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_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i[919,932] [2024-10-31 21:57:44,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:44,549 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:44,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44 WrapperNode [2024-10-31 21:57:44,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:44,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:44,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:44,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:44,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,631 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-10-31 21:57:44,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:44,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:44,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:44,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:44,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,682 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-10-31 21:57:44,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:44,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:44,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:44,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:44,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:44,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:44,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:44,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:44,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:45,317 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:45,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:45,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:45,334 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:45,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:45 BoogieIcfgContainer [2024-10-31 21:57:45,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:45,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:45,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:45,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:45,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:44" (1/3) ... [2024-10-31 21:57:45,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ba501a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:45, skipping insertion in model container [2024-10-31 21:57:45,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (2/3) ... [2024-10-31 21:57:45,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ba501a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:45, skipping insertion in model container [2024-10-31 21:57:45,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:45" (3/3) ... [2024-10-31 21:57:45,352 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-38.i [2024-10-31 21:57:45,376 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:45,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:45,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:45,443 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;@3905cd05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:45,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 21:57:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 21:57:45,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,463 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:45,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1684624578, now seen corresponding path program 1 times [2024-10-31 21:57:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297929219] [2024-10-31 21:57:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 21:57:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:57:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 21:57:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-31 21:57:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:46,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297929219] [2024-10-31 21:57:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297929219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049742300] [2024-10-31 21:57:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:46,083 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-31 21:57:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:46,125 INFO L93 Difference]: Finished difference Result 133 states and 230 transitions. [2024-10-31 21:57:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-10-31 21:57:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:46,137 INFO L225 Difference]: With dead ends: 133 [2024-10-31 21:57:46,137 INFO L226 Difference]: Without dead ends: 66 [2024-10-31 21:57:46,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10-31 21:57:46,147 INFO L432 NwaCegarLoop]: 100 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, 100 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-10-31 21:57:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-31 21:57:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-31 21:57:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 21:57:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2024-10-31 21:57:46,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 100 transitions. Word has length 140 [2024-10-31 21:57:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:46,215 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 100 transitions. [2024-10-31 21:57:46,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-31 21:57:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2024-10-31 21:57:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 21:57:46,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:46,224 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:46,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:46,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 108224694, now seen corresponding path program 1 times [2024-10-31 21:57:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699959545] [2024-10-31 21:57:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 21:57:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:57:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 21:57:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-31 21:57:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699959545] [2024-10-31 21:57:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699959545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273948593] [2024-10-31 21:57:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:47,294 INFO L87 Difference]: Start difference. First operand 66 states and 100 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-31 21:57:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:47,609 INFO L93 Difference]: Finished difference Result 249 states and 379 transitions. [2024-10-31 21:57:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-10-31 21:57:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:47,614 INFO L225 Difference]: With dead ends: 249 [2024-10-31 21:57:47,614 INFO L226 Difference]: Without dead ends: 186 [2024-10-31 21:57:47,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:47,616 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 204 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:47,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 387 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-31 21:57:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 127. [2024-10-31 21:57:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-31 21:57:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2024-10-31 21:57:47,652 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 140 [2024-10-31 21:57:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2024-10-31 21:57:47,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-31 21:57:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2024-10-31 21:57:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-31 21:57:47,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:47,656 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:47,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1900853081, now seen corresponding path program 1 times [2024-10-31 21:57:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:47,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286375172] [2024-10-31 21:57:47,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 21:57:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:57:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 21:57:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-31 21:57:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:48,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286375172] [2024-10-31 21:57:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286375172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885490441] [2024-10-31 21:57:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:48,254 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-31 21:57:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:48,714 INFO L93 Difference]: Finished difference Result 413 states and 637 transitions. [2024-10-31 21:57:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-31 21:57:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:48,719 INFO L225 Difference]: With dead ends: 413 [2024-10-31 21:57:48,720 INFO L226 Difference]: Without dead ends: 289 [2024-10-31 21:57:48,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:48,724 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 94 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:48,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 340 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-31 21:57:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 251. [2024-10-31 21:57:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 158 states have internal predecessors, (212), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-31 21:57:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 388 transitions. [2024-10-31 21:57:48,822 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 388 transitions. Word has length 141 [2024-10-31 21:57:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:48,823 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 388 transitions. [2024-10-31 21:57:48,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-31 21:57:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 388 transitions. [2024-10-31 21:57:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-31 21:57:48,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:48,830 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:48,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:48,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:48,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1807308201, now seen corresponding path program 1 times [2024-10-31 21:57:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:48,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606819126] [2024-10-31 21:57:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 21:57:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:57:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 21:57:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-31 21:57:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606819126] [2024-10-31 21:57:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606819126] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681415394] [2024-10-31 21:57:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:49,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:49,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:49,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:57:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-31 21:57:49,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 21:57:50,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-31 21:57:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681415394] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:50,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-10-31 21:57:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145062148] [2024-10-31 21:57:50,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:50,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-31 21:57:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:50,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-31 21:57:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:57:50,733 INFO L87 Difference]: Start difference. First operand 251 states and 388 transitions. Second operand has 17 states, 16 states have (on average 5.125) internal successors, (82), 17 states have internal predecessors, (82), 7 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 7 states have call predecessors, (66), 7 states have call successors, (66) [2024-10-31 21:57:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:51,928 INFO L93 Difference]: Finished difference Result 631 states and 964 transitions. [2024-10-31 21:57:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-31 21:57:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 17 states have internal predecessors, (82), 7 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 7 states have call predecessors, (66), 7 states have call successors, (66) Word has length 141 [2024-10-31 21:57:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:51,934 INFO L225 Difference]: With dead ends: 631 [2024-10-31 21:57:51,934 INFO L226 Difference]: Without dead ends: 383 [2024-10-31 21:57:51,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2024-10-31 21:57:51,938 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 391 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:51,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 483 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:57:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-31 21:57:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 283. [2024-10-31 21:57:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 188 states have (on average 1.377659574468085) internal successors, (259), 188 states have internal predecessors, (259), 88 states have call successors, (88), 6 states have call predecessors, (88), 6 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-31 21:57:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2024-10-31 21:57:52,028 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 141 [2024-10-31 21:57:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2024-10-31 21:57:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 17 states have internal predecessors, (82), 7 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 7 states have call predecessors, (66), 7 states have call successors, (66) [2024-10-31 21:57:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2024-10-31 21:57:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-31 21:57:52,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:52,038 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:52,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 21:57:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:52,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:52,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1158568945, now seen corresponding path program 1 times [2024-10-31 21:57:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745309442] [2024-10-31 21:57:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 21:57:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467718224] [2024-10-31 21:57:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:52,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:52,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:52,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:57:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:52,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:52,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:52,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:52,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:57:52,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 21:57:53,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:53,047 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 21:57:53,209 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:53,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:53 BoogieIcfgContainer [2024-10-31 21:57:53,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:53,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:53,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:53,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:53,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:45" (3/4) ... [2024-10-31 21:57:53,222 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:57:53,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:53,225 INFO L158 Benchmark]: Toolchain (without parser) took 9103.08ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.4MB in the beginning and 128.3MB in the end (delta: -5.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-10-31 21:57:53,226 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:53,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.48ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 108.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 21:57:53,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.63ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:57:53,229 INFO L158 Benchmark]: Boogie Preprocessor took 76.13ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 102.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:53,230 INFO L158 Benchmark]: RCFGBuilder took 623.94ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 83.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:53,231 INFO L158 Benchmark]: TraceAbstraction took 7876.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.0MB in the beginning and 128.3MB in the end (delta: -45.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:53,231 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:53,233 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.35ms. Allocated memory is still 167.8MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.48ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 108.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.63ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.13ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 102.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 623.94ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 83.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7876.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.0MB in the beginning and 128.3MB in the end (delta: -45.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. 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 127, overapproximation of shiftRight at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned short int last_1_var_1_8 = 4; [L41] signed short int last_1_var_1_21 = -64; [L42] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_21 = var_1_21 [L124] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L88] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L88] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L91] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L91] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L92] var_1_11 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L93] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L94] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L94] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L95] var_1_12 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L96] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L97] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L97] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L98] var_1_13 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L99] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L100] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L100] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L101] var_1_15 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L102] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L103] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L103] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L104] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L104] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L105] var_1_16 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L107] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L107] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L108] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L108] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L109] var_1_17 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L111] var_1_18 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L113] var_1_19 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L114] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L115] var_1_20 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L117] var_1_26 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L135] RET updateVariables() [L136] CALL step() [L46] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L46] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L47] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L51] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) [L56] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=8, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L58] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L65] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L67] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L68] COND TRUE \read(var_1_4) [L69] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L72] COND TRUE (- var_1_14) <= var_1_14 [L73] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L81] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L82] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L127-L128] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=8, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 1310 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 914 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 396 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 197 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 838 ConstructedInterpolants, 0 QuantifiedInterpolants, 2550 SizeOfPredicates, 2 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5463/5544 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-10-31 21:57:53,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU --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 c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:55,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:55,916 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:57:55,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:55,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:55,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:55,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:55,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:55,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:55,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:55,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:55,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:55,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:55,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:55,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:55,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:55,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:55,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:55,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:55,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:55,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:55,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:55,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:55,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:57:55,984 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:57:55,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:55,984 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:57:55,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:55,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:55,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:55,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:55,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:55,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:55,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:55,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:55,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:55,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:55,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:55,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:57:55,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:57:55,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:55,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:55,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:55,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:55,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:57:55,994 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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU 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 -> c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 [2024-10-31 21:57:56,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:56,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:56,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:56,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:56,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:56,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i Unable to find full path for "g++" [2024-10-31 21:57:58,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:58,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:58,897 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i [2024-10-31 21:57:58,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/ca22e64fa/b75fb058be094b59ba741a271eba3f67/FLAGd35b77592 [2024-10-31 21:57:58,929 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/data/ca22e64fa/b75fb058be094b59ba741a271eba3f67 [2024-10-31 21:57:58,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:58,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:58,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:58,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:58,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:58,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:58" (1/1) ... [2024-10-31 21:57:58,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235b6e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:58, skipping insertion in model container [2024-10-31 21:57:58,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:58" (1/1) ... [2024-10-31 21:57:58,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:59,219 WARN L251 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_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i[919,932] [2024-10-31 21:57:59,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:59,349 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:59,362 WARN L251 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_6d82a118-9caf-4876-914a-1822ea2b6033/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i[919,932] [2024-10-31 21:57:59,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:59,435 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:59,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59 WrapperNode [2024-10-31 21:57:59,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:59,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:59,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:59,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:59,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,514 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-10-31 21:57:59,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:59,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:59,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:59,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:59,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,581 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-10-31 21:57:59,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:59,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:59,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:59,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:59,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (1/1) ... [2024-10-31 21:57:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:59,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:59,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:59,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:57:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:59,882 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:59,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:06,565 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:06,566 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:06,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:06,584 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:06,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:06 BoogieIcfgContainer [2024-10-31 21:58:06,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:06,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:06,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:06,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:06,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:58" (1/3) ... [2024-10-31 21:58:06,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d1500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:06, skipping insertion in model container [2024-10-31 21:58:06,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:59" (2/3) ... [2024-10-31 21:58:06,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d1500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:06, skipping insertion in model container [2024-10-31 21:58:06,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:06" (3/3) ... [2024-10-31 21:58:06,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-38.i [2024-10-31 21:58:06,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:06,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:06,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:06,672 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;@c2723ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:06,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 21:58:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-31 21:58:06,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:06,691 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:58:06,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:06,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1336328274, now seen corresponding path program 1 times [2024-10-31 21:58:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:58:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303272474] [2024-10-31 21:58:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:06,717 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-10-31 21:58:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:58:06,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:06,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 21:58:07,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:58:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-31 21:58:07,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:58:07,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:58:07,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303272474] [2024-10-31 21:58:07,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303272474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675688693] [2024-10-31 21:58:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:58:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:58:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:58:07,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:58:07,433 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-31 21:58:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:07,479 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2024-10-31 21:58:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:58:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137 [2024-10-31 21:58:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:07,493 INFO L225 Difference]: With dead ends: 119 [2024-10-31 21:58:07,494 INFO L226 Difference]: Without dead ends: 59 [2024-10-31 21:58:07,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-10-31 21:58:07,506 INFO L432 NwaCegarLoop]: 89 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, 89 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-10-31 21:58:07,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-31 21:58:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-31 21:58:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 21:58:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-31 21:58:07,575 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 137 [2024-10-31 21:58:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-31 21:58:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-31 21:58:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-31 21:58:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-31 21:58:07,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:07,585 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:58:07,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:07,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:07,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash -914703752, now seen corresponding path program 1 times [2024-10-31 21:58:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:58:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707800373] [2024-10-31 21:58:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:07,789 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-10-31 21:58:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:58:07,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:07,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d82a118-9caf-4876-914a-1822ea2b6033/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:58:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 21:58:08,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:58:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-31 21:58:09,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:58:09,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:58:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707800373] [2024-10-31 21:58:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707800373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:58:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135680288] [2024-10-31 21:58:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:58:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:10,007 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-31 21:58:14,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []