./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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 04241549eabde3ff2d586f095963e5dc8050ef781bb277f02f58fe6e784fa8ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:59,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:59,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:55:59,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:59,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:59,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:59,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:59,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:59,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:59,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:59,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:55:59,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:55:59,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:59,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:59,248 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:59,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:59,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:55:59,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:55:59,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:59,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:55:59,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:59,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:55:59,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:55:59,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:55:59,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:59,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:55:59,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:55:59,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:59,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:59,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:59,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:55:59,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:55:59,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:59,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:59,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:55:59,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:55:59,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:55:59,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:55:59,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:55:59,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:55:59,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:55:59,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:55:59,269 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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 -> 04241549eabde3ff2d586f095963e5dc8050ef781bb277f02f58fe6e784fa8ed [2024-10-31 21:55:59,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:59,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:59,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:59,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:59,723 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:59,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i Unable to find full path for "g++" [2024-10-31 21:56:01,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:02,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:02,024 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i [2024-10-31 21:56:02,040 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/d66318c07/417643249e4f4f79857aacfc16aae338/FLAGb09962dc7 [2024-10-31 21:56:02,314 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/d66318c07/417643249e4f4f79857aacfc16aae338 [2024-10-31 21:56:02,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:02,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:02,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:02,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:02,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:02,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afc46a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02, skipping insertion in model container [2024-10-31 21:56:02,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:02,587 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i[916,929] [2024-10-31 21:56:02,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:02,704 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:02,715 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i[916,929] [2024-10-31 21:56:02,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:02,792 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:02,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02 WrapperNode [2024-10-31 21:56:02,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:02,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:02,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:02,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:02,804 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:56:02" (1/1) ... [2024-10-31 21:56:02,827 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:56:02" (1/1) ... [2024-10-31 21:56:02,884 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-31 21:56:02,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:02,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:02,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:02,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:02,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,954 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:56:02,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:03,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:03,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:03,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:03,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:03,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:03,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:03,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:03,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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:56:03,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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:56:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:56:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:56:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:56:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:03,224 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:03,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:03,852 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-31 21:56:03,852 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:03,872 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:03,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:56:03,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:03 BoogieIcfgContainer [2024-10-31 21:56:03,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:03,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:56:03,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:56:03,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:56:03,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:56:02" (1/3) ... [2024-10-31 21:56:03,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7894d4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:03, skipping insertion in model container [2024-10-31 21:56:03,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02" (2/3) ... [2024-10-31 21:56:03,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7894d4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:03, skipping insertion in model container [2024-10-31 21:56:03,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:03" (3/3) ... [2024-10-31 21:56:03,890 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-93.i [2024-10-31 21:56:03,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:56:03,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:56:04,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:56:04,011 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;@10b90193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:56:04,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:56:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:56:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 21:56:04,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:04,039 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 398933327, now seen corresponding path program 1 times [2024-10-31 21:56:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:04,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816658446] [2024-10-31 21:56:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:56:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816658446] [2024-10-31 21:56:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816658446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:04,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:56:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199042036] [2024-10-31 21:56:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:56:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:56:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:56:04,652 INFO L87 Difference]: Start difference. First operand has 87 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:56:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:04,701 INFO L93 Difference]: Finished difference Result 165 states and 287 transitions. [2024-10-31 21:56:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:56:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-10-31 21:56:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:04,713 INFO L225 Difference]: With dead ends: 165 [2024-10-31 21:56:04,714 INFO L226 Difference]: Without dead ends: 81 [2024-10-31 21:56:04,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:56:04,724 INFO L432 NwaCegarLoop]: 123 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, 123 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:56:04,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:56:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-31 21:56:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-31 21:56:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:56:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-31 21:56:04,787 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 155 [2024-10-31 21:56:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:04,790 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-31 21:56:04,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:56:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-31 21:56:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 21:56:04,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:04,799 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:56:04,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1443386411, now seen corresponding path program 1 times [2024-10-31 21:56:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410427023] [2024-10-31 21:56:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:56:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410427023] [2024-10-31 21:56:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410427023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:56:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331943675] [2024-10-31 21:56:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:56:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:56:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:05,228 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:05,343 INFO L93 Difference]: Finished difference Result 234 states and 358 transitions. [2024-10-31 21:56:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:56:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-31 21:56:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:05,350 INFO L225 Difference]: With dead ends: 234 [2024-10-31 21:56:05,351 INFO L226 Difference]: Without dead ends: 156 [2024-10-31 21:56:05,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:05,356 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:05,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 332 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:56:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-31 21:56:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 82. [2024-10-31 21:56:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:56:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-10-31 21:56:05,384 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 155 [2024-10-31 21:56:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-10-31 21:56:05,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-10-31 21:56:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 21:56:05,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:05,394 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:56:05,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1840463635, now seen corresponding path program 1 times [2024-10-31 21:56:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776610504] [2024-10-31 21:56:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:56:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776610504] [2024-10-31 21:56:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776610504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:56:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449807811] [2024-10-31 21:56:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:05,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:56:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:56:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:05,686 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:05,764 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-10-31 21:56:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:56:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-31 21:56:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:05,767 INFO L225 Difference]: With dead ends: 240 [2024-10-31 21:56:05,768 INFO L226 Difference]: Without dead ends: 161 [2024-10-31 21:56:05,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:05,770 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:05,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 312 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:56:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-31 21:56:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-31 21:56:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 21:56:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 241 transitions. [2024-10-31 21:56:05,818 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 241 transitions. Word has length 155 [2024-10-31 21:56:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 241 transitions. [2024-10-31 21:56:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 241 transitions. [2024-10-31 21:56:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 21:56:05,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:05,826 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:56:05,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2098629073, now seen corresponding path program 1 times [2024-10-31 21:56:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865141646] [2024-10-31 21:56:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:56:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865141646] [2024-10-31 21:56:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865141646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:06,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:06,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401103998] [2024-10-31 21:56:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:06,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:06,388 INFO L87 Difference]: Start difference. First operand 159 states and 241 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:06,670 INFO L93 Difference]: Finished difference Result 421 states and 638 transitions. [2024-10-31 21:56:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-31 21:56:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:06,677 INFO L225 Difference]: With dead ends: 421 [2024-10-31 21:56:06,677 INFO L226 Difference]: Without dead ends: 265 [2024-10-31 21:56:06,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:56:06,680 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 112 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:06,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 584 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-31 21:56:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2024-10-31 21:56:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-31 21:56:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2024-10-31 21:56:06,744 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 155 [2024-10-31 21:56:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2024-10-31 21:56:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2024-10-31 21:56:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 21:56:06,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:06,751 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:56:06,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1592661641, now seen corresponding path program 1 times [2024-10-31 21:56:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265237395] [2024-10-31 21:56:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:56:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265237395] [2024-10-31 21:56:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265237395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:07,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:56:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185736909] [2024-10-31 21:56:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:07,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:07,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:07,308 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:07,645 INFO L93 Difference]: Finished difference Result 422 states and 638 transitions. [2024-10-31 21:56:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-31 21:56:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:07,649 INFO L225 Difference]: With dead ends: 422 [2024-10-31 21:56:07,649 INFO L226 Difference]: Without dead ends: 265 [2024-10-31 21:56:07,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:07,653 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 79 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:07,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 331 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:56:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-31 21:56:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-10-31 21:56:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 174 states have internal predecessors, (239), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-31 21:56:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 377 transitions. [2024-10-31 21:56:07,702 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 377 transitions. Word has length 155 [2024-10-31 21:56:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 377 transitions. [2024-10-31 21:56:07,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:56:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 377 transitions. [2024-10-31 21:56:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-31 21:56:07,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:07,705 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:56:07,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 483770086, now seen corresponding path program 1 times [2024-10-31 21:56:07,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430016023] [2024-10-31 21:56:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:56:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430016023] [2024-10-31 21:56:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430016023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:56:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769527059] [2024-10-31 21:56:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:56:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:08,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:56:08,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:56:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-31 21:56:09,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:56:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 694 proven. 72 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-31 21:56:10,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:56:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-31 21:56:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769527059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:56:11,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:56:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 30 [2024-10-31 21:56:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438130674] [2024-10-31 21:56:11,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:56:11,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-31 21:56:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-31 21:56:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2024-10-31 21:56:11,674 INFO L87 Difference]: Start difference. First operand 247 states and 377 transitions. Second operand has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2024-10-31 21:56:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:13,996 INFO L93 Difference]: Finished difference Result 781 states and 1134 transitions. [2024-10-31 21:56:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-31 21:56:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) Word has length 157 [2024-10-31 21:56:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:14,001 INFO L225 Difference]: With dead ends: 781 [2024-10-31 21:56:14,001 INFO L226 Difference]: Without dead ends: 585 [2024-10-31 21:56:14,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=915, Invalid=2625, Unknown=0, NotChecked=0, Total=3540 [2024-10-31 21:56:14,004 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 822 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:14,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1012 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 21:56:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-31 21:56:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 375. [2024-10-31 21:56:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 282 states have (on average 1.3617021276595744) internal successors, (384), 284 states have internal predecessors, (384), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-31 21:56:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 550 transitions. [2024-10-31 21:56:14,051 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 550 transitions. Word has length 157 [2024-10-31 21:56:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:14,052 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 550 transitions. [2024-10-31 21:56:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2024-10-31 21:56:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 550 transitions. [2024-10-31 21:56:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-31 21:56:14,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:14,055 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 21:56:14,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 21:56:14,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:14,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -936065521, now seen corresponding path program 1 times [2024-10-31 21:56:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:14,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635844204] [2024-10-31 21:56:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:56:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:56:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:56:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:56:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 21:56:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:56:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:56:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:56:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:56:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 21:56:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:56:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 21:56:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:56:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:56:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:56:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:56:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:56:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:56:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:56:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:56:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:56:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:56:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635844204] [2024-10-31 21:56:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635844204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:56:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128446772] [2024-10-31 21:56:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:56:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:14,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:56:14,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:56:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:14,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 21:56:14,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:56:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-31 21:56:15,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:56:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:56:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128446772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:56:15,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:56:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-10-31 21:56:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115511389] [2024-10-31 21:56:15,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:56:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-31 21:56:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 21:56:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:56:15,911 INFO L87 Difference]: Start difference. First operand 375 states and 550 transitions. Second operand has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-10-31 21:56:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:17,066 INFO L93 Difference]: Finished difference Result 865 states and 1252 transitions. [2024-10-31 21:56:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-31 21:56:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 158 [2024-10-31 21:56:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:17,073 INFO L225 Difference]: With dead ends: 865 [2024-10-31 21:56:17,073 INFO L226 Difference]: Without dead ends: 557 [2024-10-31 21:56:17,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2024-10-31 21:56:17,076 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 834 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:17,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 826 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:56:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-31 21:56:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 463. [2024-10-31 21:56:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 345 states have (on average 1.298550724637681) internal successors, (448), 351 states have internal predecessors, (448), 103 states have call successors, (103), 14 states have call predecessors, (103), 14 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-31 21:56:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 654 transitions. [2024-10-31 21:56:17,142 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 654 transitions. Word has length 158 [2024-10-31 21:56:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:17,142 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 654 transitions. [2024-10-31 21:56:17,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-10-31 21:56:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 654 transitions. [2024-10-31 21:56:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-31 21:56:17,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:17,146 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-31 21:56:17,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1753713971, now seen corresponding path program 1 times [2024-10-31 21:56:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724854844] [2024-10-31 21:56:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:17,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:56:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:17,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:56:17,799 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:56:17,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:56:17,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:56:17,806 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:17,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:56:17,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:56:17 BoogieIcfgContainer [2024-10-31 21:56:17,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:56:17,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:56:17,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:56:17,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:56:17,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:03" (3/4) ... [2024-10-31 21:56:17,949 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:56:17,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:56:17,952 INFO L158 Benchmark]: Toolchain (without parser) took 15632.97ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.8MB in the beginning and 162.2MB in the end (delta: -22.3MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,952 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:56:17,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.99ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 121.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.39ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,953 INFO L158 Benchmark]: Boogie Preprocessor took 127.26ms. Allocated memory is still 169.9MB. Free memory was 114.8MB in the beginning and 103.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,954 INFO L158 Benchmark]: RCFGBuilder took 861.18ms. Allocated memory is still 169.9MB. Free memory was 103.7MB in the beginning and 119.1MB in the end (delta: -15.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,954 INFO L158 Benchmark]: TraceAbstraction took 14066.02ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 118.1MB in the beginning and 162.2MB in the end (delta: -44.0MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2024-10-31 21:56:17,954 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 247.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:56:17,956 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.34ms. Allocated memory is still 107.0MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.99ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 121.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.39ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.26ms. Allocated memory is still 169.9MB. Free memory was 114.8MB in the beginning and 103.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 861.18ms. Allocated memory is still 169.9MB. Free memory was 103.7MB in the beginning and 119.1MB in the end (delta: -15.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14066.02ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 118.1MB in the beginning and 162.2MB in the end (delta: -44.0MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 247.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseOr at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_4 = 1; [L24] double var_1_7 = 31.25; [L25] double var_1_8 = 7.6; [L26] double var_1_9 = 8.9; [L27] double var_1_10 = 256.8; [L28] signed short int var_1_11 = 0; [L29] unsigned long int var_1_15 = 64; [L30] signed short int var_1_18 = 16; [L31] signed short int var_1_19 = 22006; [L32] unsigned char var_1_21 = 1; [L33] unsigned char var_1_22 = 0; [L34] float var_1_23 = 2.25; [L35] signed long int var_1_24 = -1; [L36] unsigned char var_1_26 = 32; [L37] unsigned char var_1_27 = 200; [L38] unsigned char var_1_28 = 5; [L39] unsigned char var_1_29 = 64; [L40] unsigned char var_1_30 = 64; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 5; [L43] signed char var_1_33 = 2; [L44] signed char var_1_34 = 32; [L45] unsigned short int var_1_35 = 16; [L46] float var_1_37 = 63.5; [L47] signed long int last_1_var_1_24 = -1; [L48] unsigned char last_1_var_1_26 = 32; [L49] signed char last_1_var_1_33 = 2; [L50] unsigned short int last_1_var_1_35 = 16; VAL [isInitial=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_26 = var_1_26 [L183] last_1_var_1_33 = var_1_33 [L184] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L147] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L149] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L150] var_1_10 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L151] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L152] var_1_19 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L153] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L155] var_1_22 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L156] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L158] var_1_27 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_27 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L159] RET assume_abort_if_not(var_1_27 >= 190) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L161] var_1_28 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L162] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L164] var_1_29 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_29 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L165] RET assume_abort_if_not(var_1_29 >= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L167] var_1_30 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_30 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L168] RET assume_abort_if_not(var_1_30 >= 31) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] CALL assume_abort_if_not(var_1_30 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] RET assume_abort_if_not(var_1_30 <= 64) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L171] RET assume_abort_if_not(var_1_31 >= 32) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L176] var_1_34 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L195] RET updateVariables() [L196] CALL step() [L54] signed long int stepLocal_6 = last_1_var_1_24; [L55] unsigned char stepLocal_5 = var_1_30; [L56] signed long int stepLocal_4 = last_1_var_1_24; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-192, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] EXPR last_1_var_1_35 | 100000000 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-192, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] COND TRUE stepLocal_6 < (last_1_var_1_35 | 100000000) [L58] COND TRUE stepLocal_5 > last_1_var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L59] COND FALSE !(var_1_19 < stepLocal_4) [L62] var_1_35 = (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33)))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=33, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L74] COND TRUE \read(var_1_4) [L75] var_1_21 = (! var_1_22) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=33, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L77] COND TRUE ! var_1_21 [L78] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=33, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L80] COND TRUE (var_1_8 + 199.375) <= 10.5 [L81] var_1_26 = ((var_1_27 - var_1_28) - (var_1_29 - 1)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=2, var_1_34=1, var_1_35=33, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L89] COND TRUE \read(var_1_22) [L90] var_1_33 = ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L92] var_1_37 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L93] COND FALSE !((- var_1_8) != var_1_23) [L96] var_1_11 = ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L98] COND TRUE var_1_26 == var_1_11 [L99] var_1_15 = ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L107] COND FALSE !((var_1_11 == var_1_15) && var_1_21) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L110] signed short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=32, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L111] COND TRUE var_1_1 != stepLocal_3 [L112] var_1_18 = (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L114] COND FALSE !(var_1_18 != var_1_18) [L123] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L125] signed short int stepLocal_2 = var_1_11; [L126] signed long int stepLocal_1 = var_1_1; [L127] unsigned short int stepLocal_0 = var_1_35; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=33, stepLocal_1=-256, stepLocal_2=32, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L128] COND FALSE !(stepLocal_0 == var_1_1) [L139] var_1_7 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_1=-256, stepLocal_2=32, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L187-L188] return (((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28))))) && (var_1_37 == ((float) var_1_10)) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=32, var_1_15=33, var_1_18=-32726, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=32, var_1_26=32, var_1_27=90046, var_1_28=-224, var_1_29=-129, var_1_30=-192, var_1_31=41508, var_1_32=63, var_1_33=4, var_1_34=1, var_1_35=33, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2076 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2068 mSDsluCounter, 3520 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2509 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 1011 mSDtfsCounter, 1522 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1066 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=7, InterpolantAutomatonStates: 76, 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, 7 MinimizatonAttempts, 458 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 5912 SizeOfPredicates, 7 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 10847/11132 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:56:18,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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 04241549eabde3ff2d586f095963e5dc8050ef781bb277f02f58fe6e784fa8ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:56:20,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:56:20,687 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:56:20,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:56:20,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:56:20,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:56:20,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:56:20,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:56:20,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:56:20,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:56:20,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:56:20,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:56:20,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:56:20,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:56:20,752 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:56:20,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:56:20,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:56:20,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:56:20,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:56:20,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:56:20,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:56:20,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:56:20,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:56:20,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:56:20,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:56:20,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:56:20,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:56:20,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:56:20,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:56:20,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:56:20,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:56:20,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:56:20,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:56:20,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:56:20,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:20,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:56:20,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:56:20,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:56:20,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:56:20,770 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:56:20,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:56:20,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:56:20,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:56:20,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:56:20,771 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:56:20,771 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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 -> 04241549eabde3ff2d586f095963e5dc8050ef781bb277f02f58fe6e784fa8ed [2024-10-31 21:56:21,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:56:21,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:56:21,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:56:21,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:56:21,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:56:21,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i Unable to find full path for "g++" [2024-10-31 21:56:23,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:23,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:23,827 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i [2024-10-31 21:56:23,839 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/2be0f2e31/266330b55bf04f8ca164ba6edf60a54f/FLAG67744bbdb [2024-10-31 21:56:24,093 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/data/2be0f2e31/266330b55bf04f8ca164ba6edf60a54f [2024-10-31 21:56:24,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:24,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:24,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:24,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:24,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:24,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c14e71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24, skipping insertion in model container [2024-10-31 21:56:24,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:24,451 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i[916,929] [2024-10-31 21:56:24,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:24,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:24,638 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_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-93.i[916,929] [2024-10-31 21:56:24,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:24,770 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:24,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24 WrapperNode [2024-10-31 21:56:24,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:24,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:24,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:24,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:24,782 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:56:24" (1/1) ... [2024-10-31 21:56:24,807 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:56:24" (1/1) ... [2024-10-31 21:56:24,868 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-31 21:56:24,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:24,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:24,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:24,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:24,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,940 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:56:24,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:24,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:25,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:25,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:25,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:25,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:25,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:25,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (1/1) ... [2024-10-31 21:56:25,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:25,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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:56:25,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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:56:25,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:56:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:56:25,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:56:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:25,261 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:25,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:30,412 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-31 21:56:30,412 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:30,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:30,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:56:30,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:30 BoogieIcfgContainer [2024-10-31 21:56:30,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:30,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:56:30,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:56:30,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:56:30,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:56:24" (1/3) ... [2024-10-31 21:56:30,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36670a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:30, skipping insertion in model container [2024-10-31 21:56:30,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:24" (2/3) ... [2024-10-31 21:56:30,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36670a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:30, skipping insertion in model container [2024-10-31 21:56:30,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:30" (3/3) ... [2024-10-31 21:56:30,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-93.i [2024-10-31 21:56:30,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:56:30,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:56:30,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:56:30,572 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;@184dc888, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:56:30,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:56:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:56:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 21:56:30,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:30,595 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:30,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1471174150, now seen corresponding path program 1 times [2024-10-31 21:56:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:56:30,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941710737] [2024-10-31 21:56:30,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:30,616 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:56:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:56:30,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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:56:30,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c85a2d4b-9bfb-4ffd-9c55-6c5f9c805586/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