./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:49,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:50,138 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:50,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:50,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:50,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:50,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:50,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:50,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:50,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:50,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:50,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:50,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:50,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:50,202 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:50,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:50,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:50,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:50,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:50,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:50,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:50,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:50,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:50,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:50,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:50,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:50,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:50,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:50,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:50,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:50,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:50,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:50,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:50,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:50,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:50,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:50,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:50,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:50,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:50,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:50,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:50,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:50,217 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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 -> 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db [2024-10-31 22:17:50,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:50,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:50,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:50,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:50,522 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:50,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i Unable to find full path for "g++" [2024-10-31 22:17:52,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:52,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:52,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i [2024-10-31 22:17:52,790 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/ca27602f2/37e8421856024bcd89553df493b75aa2/FLAG6202aac75 [2024-10-31 22:17:53,078 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/ca27602f2/37e8421856024bcd89553df493b75aa2 [2024-10-31 22:17:53,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:53,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:53,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:53,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:53,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:53,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26692a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53, skipping insertion in model container [2024-10-31 22:17:53,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:53,374 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i[916,929] [2024-10-31 22:17:53,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:53,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:53,490 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i[916,929] [2024-10-31 22:17:53,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:53,573 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:53,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53 WrapperNode [2024-10-31 22:17:53,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:53,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:53,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:53,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:53,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,686 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-31 22:17:53,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:53,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:53,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:53,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:53,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,760 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 22:17:53,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:53,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:53,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:53,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:53,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (1/1) ... [2024-10-31 22:17:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:53,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:53,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:53,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:53,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:17:53,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:53,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:54,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:54,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:54,560 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:54,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:54,579 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:54,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:54,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:54 BoogieIcfgContainer [2024-10-31 22:17:54,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:54,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:54,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:54,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:53" (1/3) ... [2024-10-31 22:17:54,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab9b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:54, skipping insertion in model container [2024-10-31 22:17:54,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:53" (2/3) ... [2024-10-31 22:17:54,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab9b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:54, skipping insertion in model container [2024-10-31 22:17:54,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:54" (3/3) ... [2024-10-31 22:17:54,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-93.i [2024-10-31 22:17:54,615 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:54,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:54,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:54,765 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;@bfb5990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:54,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:54,771 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 22:17:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:17:54,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:54,791 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 22:17:54,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 398933327, now seen corresponding path program 1 times [2024-10-31 22:17:54,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143723877] [2024-10-31 22:17:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,367 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 22:17:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:55,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143723877] [2024-10-31 22:17:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143723877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:55,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:55,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568186735] [2024-10-31 22:17:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:55,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:55,409 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 22:17:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:55,454 INFO L93 Difference]: Finished difference Result 165 states and 287 transitions. [2024-10-31 22:17:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:55,456 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 22:17:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:55,467 INFO L225 Difference]: With dead ends: 165 [2024-10-31 22:17:55,468 INFO L226 Difference]: Without dead ends: 81 [2024-10-31 22:17:55,471 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 22:17:55,474 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 22:17:55,476 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 22:17:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-31 22:17:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-31 22:17:55,533 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 22:17:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-31 22:17:55,537 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 155 [2024-10-31 22:17:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:55,539 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-31 22:17:55,539 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 22:17:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-31 22:17:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:17:55,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:55,543 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 22:17:55,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:55,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:55,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1443386411, now seen corresponding path program 1 times [2024-10-31 22:17:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549808860] [2024-10-31 22:17:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,063 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 22:17:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549808860] [2024-10-31 22:17:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549808860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:56,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:17:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744244658] [2024-10-31 22:17:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:56,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:17:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:17:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:17:56,071 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 22:17:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:56,226 INFO L93 Difference]: Finished difference Result 234 states and 358 transitions. [2024-10-31 22:17:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:17:56,227 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 22:17:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:56,232 INFO L225 Difference]: With dead ends: 234 [2024-10-31 22:17:56,232 INFO L226 Difference]: Without dead ends: 156 [2024-10-31 22:17:56,235 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 22:17:56,237 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 22:17:56,237 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 22:17:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-31 22:17:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 82. [2024-10-31 22:17:56,267 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 22:17:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-10-31 22:17:56,274 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 155 [2024-10-31 22:17:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-10-31 22:17:56,277 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 22:17:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-10-31 22:17:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:17:56,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:56,283 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 22:17:56,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:56,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1840463635, now seen corresponding path program 1 times [2024-10-31 22:17:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064464811] [2024-10-31 22:17:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,603 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 22:17:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064464811] [2024-10-31 22:17:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064464811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:17:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753711563] [2024-10-31 22:17:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:56,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:17:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:17:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:17:56,608 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 22:17:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:56,689 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-10-31 22:17:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:17:56,692 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 22:17:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:56,694 INFO L225 Difference]: With dead ends: 240 [2024-10-31 22:17:56,694 INFO L226 Difference]: Without dead ends: 161 [2024-10-31 22:17:56,699 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 22:17:56,700 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 22:17:56,700 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 22:17:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-31 22:17:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-31 22:17:56,730 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 22:17:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 241 transitions. [2024-10-31 22:17:56,733 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 241 transitions. Word has length 155 [2024-10-31 22:17:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 241 transitions. [2024-10-31 22:17:56,738 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 22:17:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 241 transitions. [2024-10-31 22:17:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:17:56,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:56,741 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 22:17:56,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:56,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:56,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2098629073, now seen corresponding path program 1 times [2024-10-31 22:17:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870871134] [2024-10-31 22:17:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,344 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 22:17:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870871134] [2024-10-31 22:17:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870871134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:57,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:57,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:57,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674595216] [2024-10-31 22:17:57,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:57,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:57,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:57,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:57,347 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 22:17:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:57,630 INFO L93 Difference]: Finished difference Result 421 states and 638 transitions. [2024-10-31 22:17:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:17:57,631 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 22:17:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:57,634 INFO L225 Difference]: With dead ends: 421 [2024-10-31 22:17:57,634 INFO L226 Difference]: Without dead ends: 265 [2024-10-31 22:17:57,635 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 22:17:57,636 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 22:17:57,637 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 22:17:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-31 22:17:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2024-10-31 22:17:57,668 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 22:17:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2024-10-31 22:17:57,671 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 155 [2024-10-31 22:17:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:57,672 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2024-10-31 22:17:57,672 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 22:17:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2024-10-31 22:17:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:17:57,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:57,678 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 22:17:57,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:57,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:57,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1592661641, now seen corresponding path program 1 times [2024-10-31 22:17:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703037821] [2024-10-31 22:17:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,126 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 22:17:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703037821] [2024-10-31 22:17:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703037821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:58,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892754921] [2024-10-31 22:17:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:58,130 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 22:17:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:58,367 INFO L93 Difference]: Finished difference Result 422 states and 638 transitions. [2024-10-31 22:17:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:58,368 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 22:17:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:58,371 INFO L225 Difference]: With dead ends: 422 [2024-10-31 22:17:58,371 INFO L226 Difference]: Without dead ends: 265 [2024-10-31 22:17:58,372 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 22:17:58,373 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.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:58,373 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.2s Time] [2024-10-31 22:17:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-31 22:17:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-10-31 22:17:58,408 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 22:17:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 377 transitions. [2024-10-31 22:17:58,410 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 377 transitions. Word has length 155 [2024-10-31 22:17:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:58,411 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 377 transitions. [2024-10-31 22:17:58,412 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 22:17:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 377 transitions. [2024-10-31 22:17:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-31 22:17:58,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:58,414 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 22:17:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:58,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 483770086, now seen corresponding path program 1 times [2024-10-31 22:17:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604670437] [2024-10-31 22:17:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:17:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:17:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:17:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:17:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:17:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:17:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:17:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:17:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:17:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:17:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:17:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:17:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:17:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:17:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:17:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:17:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,254 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 22:17:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604670437] [2024-10-31 22:17:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604670437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:17:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469930743] [2024-10-31 22:17:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:59,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:17:59,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:59,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:17:59,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:17:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-31 22:17:59,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:01,092 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 22:18:01,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:02,158 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 22:18:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469930743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:02,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 30 [2024-10-31 22:18:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320861335] [2024-10-31 22:18:02,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:02,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-31 22:18:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-31 22:18:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2024-10-31 22:18:02,163 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 22:18:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:04,355 INFO L93 Difference]: Finished difference Result 781 states and 1134 transitions. [2024-10-31 22:18:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-31 22:18:04,357 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 22:18:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:04,364 INFO L225 Difference]: With dead ends: 781 [2024-10-31 22:18:04,364 INFO L226 Difference]: Without dead ends: 585 [2024-10-31 22:18:04,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=915, Invalid=2625, Unknown=0, NotChecked=0, Total=3540 [2024-10-31 22:18:04,367 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 22:18:04,368 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 22:18:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-31 22:18:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 375. [2024-10-31 22:18:04,433 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 22:18:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 550 transitions. [2024-10-31 22:18:04,438 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 550 transitions. Word has length 157 [2024-10-31 22:18:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 550 transitions. [2024-10-31 22:18:04,440 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 22:18:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 550 transitions. [2024-10-31 22:18:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-31 22:18:04,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:04,443 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 22:18:04,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:18:04,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:04,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:04,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -936065521, now seen corresponding path program 1 times [2024-10-31 22:18:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692527157] [2024-10-31 22:18:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:18:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:18:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:18:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:18:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:18:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:18:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:18:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:18:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:18:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:18:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:18:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:18:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-31 22:18:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:18:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:18:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:18:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:18:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:18:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:18:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:18:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:18:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,183 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 22:18:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692527157] [2024-10-31 22:18:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692527157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596147000] [2024-10-31 22:18:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:05,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:05,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:05,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:05,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:18:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:05,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 22:18:05,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:05,957 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 22:18:05,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:06,300 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 22:18:06,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596147000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:06,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:06,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-10-31 22:18:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707622625] [2024-10-31 22:18:06,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-31 22:18:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 22:18:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:18:06,305 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 22:18:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:07,541 INFO L93 Difference]: Finished difference Result 865 states and 1252 transitions. [2024-10-31 22:18:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-31 22:18:07,542 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 22:18:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:07,550 INFO L225 Difference]: With dead ends: 865 [2024-10-31 22:18:07,551 INFO L226 Difference]: Without dead ends: 557 [2024-10-31 22:18:07,553 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 22:18:07,555 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 834 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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 22:18:07,555 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 22:18:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-31 22:18:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 463. [2024-10-31 22:18:07,614 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 22:18:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 654 transitions. [2024-10-31 22:18:07,618 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 654 transitions. Word has length 158 [2024-10-31 22:18:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:07,619 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 654 transitions. [2024-10-31 22:18:07,619 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 22:18:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 654 transitions. [2024-10-31 22:18:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-31 22:18:07,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:07,621 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 22:18:07,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:18:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:07,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1753713971, now seen corresponding path program 1 times [2024-10-31 22:18:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289922037] [2024-10-31 22:18:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:18:08,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:18:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:18:08,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:18:08,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:18:08,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:18:08,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:18:08,321 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:08,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:18:08,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:18:08 BoogieIcfgContainer [2024-10-31 22:18:08,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:18:08,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:18:08,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:18:08,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:18:08,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:54" (3/4) ... [2024-10-31 22:18:08,469 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:18:08,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:18:08,471 INFO L158 Benchmark]: Toolchain (without parser) took 15389.77ms. Allocated memory was 178.3MB in the beginning and 274.7MB in the end (delta: 96.5MB). Free memory was 148.4MB in the beginning and 222.1MB in the end (delta: -73.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,471 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:18:08,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.08ms. Allocated memory is still 178.3MB. Free memory was 148.4MB in the beginning and 130.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.83ms. Allocated memory is still 178.3MB. Free memory was 130.1MB in the beginning and 123.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,472 INFO L158 Benchmark]: Boogie Preprocessor took 130.18ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 112.8MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,473 INFO L158 Benchmark]: RCFGBuilder took 763.90ms. Allocated memory is still 178.3MB. Free memory was 112.8MB in the beginning and 79.8MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,473 INFO L158 Benchmark]: TraceAbstraction took 13879.10ms. Allocated memory was 178.3MB in the beginning and 274.7MB in the end (delta: 96.5MB). Free memory was 79.2MB in the beginning and 222.1MB in the end (delta: -142.8MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-10-31 22:18:08,473 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 274.7MB. Free memory is still 222.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:18:08,478 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.16ms. Allocated memory is still 123.7MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.08ms. Allocated memory is still 178.3MB. Free memory was 148.4MB in the beginning and 130.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.83ms. Allocated memory is still 178.3MB. Free memory was 130.1MB in the beginning and 123.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.18ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 112.8MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 763.90ms. Allocated memory is still 178.3MB. Free memory was 112.8MB in the beginning and 79.8MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13879.10ms. Allocated memory was 178.3MB in the beginning and 274.7MB in the end (delta: 96.5MB). Free memory was 79.2MB in the beginning and 222.1MB in the end (delta: -142.8MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 274.7MB. Free memory is still 222.1MB. 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.6s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, 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.1s 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.2s 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 22:18:08,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:18:11,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:18:11,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:18:11,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:18:11,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:18:11,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:18:11,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:18:11,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:18:11,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:18:11,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:18:11,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:18:11,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:18:11,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:18:11,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:18:11,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:18:11,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:18:11,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:18:11,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:18:11,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:18:11,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:18:11,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:18:11,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:18:11,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:18:11,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:18:11,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:18:11,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:18:11,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:18:11,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:18:11,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:18:11,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:18:11,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:18:11,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:18:11,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:18:11,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:18:11,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:11,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:18:11,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:18:11,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:18:11,305 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:18:11,305 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:18:11,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:18:11,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:18:11,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:18:11,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:18:11,306 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:18:11,306 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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 -> 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db [2024-10-31 22:18:11,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:18:11,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:18:11,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:18:11,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:18:11,759 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:18:11,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i Unable to find full path for "g++" [2024-10-31 22:18:13,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:18:14,088 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:18:14,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i [2024-10-31 22:18:14,110 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/92856bd1e/500625ed70574f5cbdc303f589ac7ef1/FLAG46ba2c7fd [2024-10-31 22:18:14,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/data/92856bd1e/500625ed70574f5cbdc303f589ac7ef1 [2024-10-31 22:18:14,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:18:14,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:18:14,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:14,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:18:14,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:18:14,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563a584a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14, skipping insertion in model container [2024-10-31 22:18:14,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:18:14,443 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i[916,929] [2024-10-31 22:18:14,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:14,588 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:18:14,611 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_2e83d85e-3c74-40e8-85a0-2cd0fd043300/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i[916,929] [2024-10-31 22:18:14,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:14,728 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:18:14,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14 WrapperNode [2024-10-31 22:18:14,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:14,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:14,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:18:14,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:18:14,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,817 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-31 22:18:14,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:14,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:18:14,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:18:14,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:18:14,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,866 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 22:18:14,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:18:14,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:18:14,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:18:14,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:18:14,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:14,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:18:14,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:18:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:18:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:18:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:18:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:18:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:18:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:18:15,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:18:15,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:18:21,354 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-31 22:18:21,355 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:18:21,375 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:18:21,375 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:18:21,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:21 BoogieIcfgContainer [2024-10-31 22:18:21,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:18:21,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:18:21,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:18:21,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:18:21,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:18:14" (1/3) ... [2024-10-31 22:18:21,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d245133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:21, skipping insertion in model container [2024-10-31 22:18:21,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (2/3) ... [2024-10-31 22:18:21,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d245133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:21, skipping insertion in model container [2024-10-31 22:18:21,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:21" (3/3) ... [2024-10-31 22:18:21,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-93.i [2024-10-31 22:18:21,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:18:21,409 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:18:21,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:18:21,498 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;@145ae5c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:18:21,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:18:21,503 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 22:18:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:18:21,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:21,525 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 22:18:21,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:21,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1471174150, now seen corresponding path program 1 times [2024-10-31 22:18:21,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:18:21,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247942228] [2024-10-31 22:18:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:21,550 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 22:18:21,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:18:21,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/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 22:18:21,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e83d85e-3c74-40e8-85a0-2cd0fd043300/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:18:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:22,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:18:22,234 INFO L278 TraceCheckSpWp]: Computing forward predicates...