./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/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 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:54,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:54,947 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:58:54,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:54,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:54,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:54,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:54,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:54,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:58:54,987 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:58:54,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:54,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:54,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:54,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:54,990 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:54,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:54,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:54,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:54,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:54,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:54,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:55,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:55,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:55,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:55,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:55,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:55,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:55,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:55,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:55,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:55,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:58:55,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:55,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:55,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:55,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:55,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:55,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:55,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:55,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:55,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:55,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:55,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:55,019 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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/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 -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2024-10-31 21:58:55,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:55,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:55,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:55,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:55,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:55,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i Unable to find full path for "g++" [2024-10-31 21:58:57,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:57,641 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:57,642 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-31 21:58:57,658 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/data/4b6bcab0f/39284c8617be4ad19486cc0341a998bb/FLAG1805eb9a0 [2024-10-31 21:58:57,965 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/data/4b6bcab0f/39284c8617be4ad19486cc0341a998bb [2024-10-31 21:58:57,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:57,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:57,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:57,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:57,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:57,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:57" (1/1) ... [2024-10-31 21:58:57,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a89211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:57, skipping insertion in model container [2024-10-31 21:58:57,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:57" (1/1) ... [2024-10-31 21:58:58,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:58,236 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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2024-10-31 21:58:58,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:58,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:58,345 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_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2024-10-31 21:58:58,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:58,423 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:58,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58 WrapperNode [2024-10-31 21:58:58,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:58,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:58,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:58,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:58,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,501 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-31 21:58:58,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:58,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:58,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:58,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:58,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,562 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:58:58,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:58,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:58,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:58,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:58,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (1/1) ... [2024-10-31 21:58:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:58,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:58,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:58:58,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:58:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:58:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:58,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:58,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:58,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:59,596 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:59,596 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:59,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:59,614 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:59,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:59 BoogieIcfgContainer [2024-10-31 21:58:59,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:59,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:59,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:59,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:59,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:57" (1/3) ... [2024-10-31 21:58:59,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac81c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:59, skipping insertion in model container [2024-10-31 21:58:59,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:58" (2/3) ... [2024-10-31 21:58:59,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac81c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:59, skipping insertion in model container [2024-10-31 21:58:59,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:59" (3/3) ... [2024-10-31 21:58:59,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-31 21:58:59,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:59,648 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:59,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:59,744 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;@11916239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:59,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-31 21:58:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-31 21:58:59,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:59,770 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:59,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:59,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1813487400, now seen corresponding path program 1 times [2024-10-31 21:58:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12234442] [2024-10-31 21:58:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12234442] [2024-10-31 21:59:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12234442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:00,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197781213] [2024-10-31 21:59:00,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:59:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:59:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:59:00,518 INFO L87 Difference]: Start difference. First operand has 120 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-31 21:59:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:00,574 INFO L93 Difference]: Finished difference Result 233 states and 405 transitions. [2024-10-31 21:59:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:59:00,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 222 [2024-10-31 21:59:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:00,589 INFO L225 Difference]: With dead ends: 233 [2024-10-31 21:59:00,590 INFO L226 Difference]: Without dead ends: 116 [2024-10-31 21:59:00,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:59:00,602 INFO L432 NwaCegarLoop]: 181 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, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:00,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-31 21:59:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-31 21:59:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-31 21:59:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-10-31 21:59:00,680 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 222 [2024-10-31 21:59:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-10-31 21:59:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-31 21:59:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-10-31 21:59:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-31 21:59:00,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:00,688 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:00,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2012324522, now seen corresponding path program 1 times [2024-10-31 21:59:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651767101] [2024-10-31 21:59:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651767101] [2024-10-31 21:59:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651767101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963724462] [2024-10-31 21:59:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:01,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:01,333 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:01,418 INFO L93 Difference]: Finished difference Result 260 states and 405 transitions. [2024-10-31 21:59:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-31 21:59:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:01,421 INFO L225 Difference]: With dead ends: 260 [2024-10-31 21:59:01,421 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 21:59:01,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:01,426 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:01,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 316 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 21:59:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-10-31 21:59:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-31 21:59:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2024-10-31 21:59:01,467 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 222 [2024-10-31 21:59:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2024-10-31 21:59:01,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2024-10-31 21:59:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-31 21:59:01,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:01,479 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:01,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:01,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:01,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash 325564219, now seen corresponding path program 1 times [2024-10-31 21:59:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051637202] [2024-10-31 21:59:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:01,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051637202] [2024-10-31 21:59:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051637202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427514136] [2024-10-31 21:59:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:01,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:01,857 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:01,983 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2024-10-31 21:59:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-10-31 21:59:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:01,992 INFO L225 Difference]: With dead ends: 366 [2024-10-31 21:59:01,992 INFO L226 Difference]: Without dead ends: 249 [2024-10-31 21:59:01,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:01,997 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 165 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:01,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 461 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-31 21:59:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2024-10-31 21:59:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 147 states have internal predecessors, (185), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-31 21:59:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2024-10-31 21:59:02,061 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 223 [2024-10-31 21:59:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2024-10-31 21:59:02,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2024-10-31 21:59:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-31 21:59:02,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:02,072 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:02,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:02,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -954299459, now seen corresponding path program 1 times [2024-10-31 21:59:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119393309] [2024-10-31 21:59:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119393309] [2024-10-31 21:59:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119393309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:02,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027945234] [2024-10-31 21:59:02,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:02,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:02,818 INFO L87 Difference]: Start difference. First operand 236 states and 357 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:03,470 INFO L93 Difference]: Finished difference Result 689 states and 1044 transitions. [2024-10-31 21:59:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-10-31 21:59:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:03,479 INFO L225 Difference]: With dead ends: 689 [2024-10-31 21:59:03,480 INFO L226 Difference]: Without dead ends: 482 [2024-10-31 21:59:03,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:03,486 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 261 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:03,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 603 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:59:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-31 21:59:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 331. [2024-10-31 21:59:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 221 states have internal predecessors, (292), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-31 21:59:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 502 transitions. [2024-10-31 21:59:03,566 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 502 transitions. Word has length 223 [2024-10-31 21:59:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:03,568 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 502 transitions. [2024-10-31 21:59:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2024-10-31 21:59:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-31 21:59:03,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:03,572 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:03,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:03,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1212678563, now seen corresponding path program 1 times [2024-10-31 21:59:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205371617] [2024-10-31 21:59:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205371617] [2024-10-31 21:59:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205371617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:04,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454805782] [2024-10-31 21:59:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:04,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:04,561 INFO L87 Difference]: Start difference. First operand 331 states and 502 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:05,283 INFO L93 Difference]: Finished difference Result 763 states and 1146 transitions. [2024-10-31 21:59:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-10-31 21:59:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:05,287 INFO L225 Difference]: With dead ends: 763 [2024-10-31 21:59:05,288 INFO L226 Difference]: Without dead ends: 495 [2024-10-31 21:59:05,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:05,290 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 211 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:05,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 618 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 21:59:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-31 21:59:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 471. [2024-10-31 21:59:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 323 states have (on average 1.303405572755418) internal successors, (421), 324 states have internal predecessors, (421), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-31 21:59:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 701 transitions. [2024-10-31 21:59:05,359 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 701 transitions. Word has length 224 [2024-10-31 21:59:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 701 transitions. [2024-10-31 21:59:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 701 transitions. [2024-10-31 21:59:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-31 21:59:05,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:05,364 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:05,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash -571558125, now seen corresponding path program 1 times [2024-10-31 21:59:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:05,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200321488] [2024-10-31 21:59:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200321488] [2024-10-31 21:59:05,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200321488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:05,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:05,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:05,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142880357] [2024-10-31 21:59:05,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:05,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:05,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:05,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:05,728 INFO L87 Difference]: Start difference. First operand 471 states and 701 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:05,789 INFO L93 Difference]: Finished difference Result 880 states and 1307 transitions. [2024-10-31 21:59:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-31 21:59:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:05,793 INFO L225 Difference]: With dead ends: 880 [2024-10-31 21:59:05,794 INFO L226 Difference]: Without dead ends: 472 [2024-10-31 21:59:05,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:05,796 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:05,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-31 21:59:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-10-31 21:59:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 324 states have (on average 1.2962962962962963) internal successors, (420), 325 states have internal predecessors, (420), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-31 21:59:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 700 transitions. [2024-10-31 21:59:05,859 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 700 transitions. Word has length 225 [2024-10-31 21:59:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 700 transitions. [2024-10-31 21:59:05,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 700 transitions. [2024-10-31 21:59:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-31 21:59:05,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:05,864 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:05,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:05,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:05,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1158364139, now seen corresponding path program 1 times [2024-10-31 21:59:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342856249] [2024-10-31 21:59:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342856249] [2024-10-31 21:59:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342856249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859419537] [2024-10-31 21:59:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:06,289 INFO L87 Difference]: Start difference. First operand 472 states and 700 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:07,002 INFO L93 Difference]: Finished difference Result 740 states and 1104 transitions. [2024-10-31 21:59:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:07,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-31 21:59:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:07,008 INFO L225 Difference]: With dead ends: 740 [2024-10-31 21:59:07,008 INFO L226 Difference]: Without dead ends: 601 [2024-10-31 21:59:07,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:07,010 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 290 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:07,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1108 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:59:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-31 21:59:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 479. [2024-10-31 21:59:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 331 states have (on average 1.299093655589124) internal successors, (430), 332 states have internal predecessors, (430), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-31 21:59:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 710 transitions. [2024-10-31 21:59:07,105 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 710 transitions. Word has length 225 [2024-10-31 21:59:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:07,105 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 710 transitions. [2024-10-31 21:59:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 710 transitions. [2024-10-31 21:59:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-31 21:59:07,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:07,109 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:07,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:07,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:07,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1855550824, now seen corresponding path program 1 times [2024-10-31 21:59:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:07,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949070777] [2024-10-31 21:59:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949070777] [2024-10-31 21:59:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949070777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339535276] [2024-10-31 21:59:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:07,671 INFO L87 Difference]: Start difference. First operand 479 states and 710 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:07,826 INFO L93 Difference]: Finished difference Result 906 states and 1342 transitions. [2024-10-31 21:59:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:07,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-31 21:59:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:07,830 INFO L225 Difference]: With dead ends: 906 [2024-10-31 21:59:07,830 INFO L226 Difference]: Without dead ends: 490 [2024-10-31 21:59:07,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:07,832 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 153 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:07,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 703 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-31 21:59:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 479. [2024-10-31 21:59:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 331 states have (on average 1.2749244712990937) internal successors, (422), 332 states have internal predecessors, (422), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-31 21:59:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 702 transitions. [2024-10-31 21:59:07,958 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 702 transitions. Word has length 225 [2024-10-31 21:59:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:07,959 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 702 transitions. [2024-10-31 21:59:07,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 702 transitions. [2024-10-31 21:59:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-31 21:59:07,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:07,963 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:07,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:07,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:07,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash -79287579, now seen corresponding path program 1 times [2024-10-31 21:59:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478569289] [2024-10-31 21:59:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478569289] [2024-10-31 21:59:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478569289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108880259] [2024-10-31 21:59:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:08,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:08,408 INFO L87 Difference]: Start difference. First operand 479 states and 702 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:09,574 INFO L93 Difference]: Finished difference Result 1156 states and 1674 transitions. [2024-10-31 21:59:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:09,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2024-10-31 21:59:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:09,581 INFO L225 Difference]: With dead ends: 1156 [2024-10-31 21:59:09,581 INFO L226 Difference]: Without dead ends: 1010 [2024-10-31 21:59:09,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:09,583 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 364 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:09,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 751 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:59:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-10-31 21:59:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 774. [2024-10-31 21:59:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 552 states have (on average 1.2844202898550725) internal successors, (709), 553 states have internal predecessors, (709), 210 states have call successors, (210), 11 states have call predecessors, (210), 11 states have return successors, (210), 209 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-31 21:59:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1129 transitions. [2024-10-31 21:59:09,873 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1129 transitions. Word has length 229 [2024-10-31 21:59:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1129 transitions. [2024-10-31 21:59:09,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1129 transitions. [2024-10-31 21:59:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-31 21:59:09,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:09,879 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:09,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:09,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1173353249, now seen corresponding path program 1 times [2024-10-31 21:59:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715189652] [2024-10-31 21:59:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:59:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:59:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:59:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:59:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:59:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:59:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:59:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 21:59:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 21:59:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:59:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 21:59:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:59:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:59:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:59:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 21:59:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:59:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 21:59:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:59:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:59:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:59:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:59:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:59:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:59:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:59:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:59:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:59:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-31 21:59:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-31 21:59:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-31 21:59:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:59:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:59:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:59:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:59:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-31 21:59:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:19,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715189652] [2024-10-31 21:59:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715189652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:19,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 21:59:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538904312] [2024-10-31 21:59:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:19,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 21:59:19,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 21:59:19,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:59:19,659 INFO L87 Difference]: Start difference. First operand 774 states and 1129 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:23,098 INFO L93 Difference]: Finished difference Result 1500 states and 2121 transitions. [2024-10-31 21:59:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:59:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2024-10-31 21:59:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:23,107 INFO L225 Difference]: With dead ends: 1500 [2024-10-31 21:59:23,107 INFO L226 Difference]: Without dead ends: 1224 [2024-10-31 21:59:23,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:59:23,110 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 249 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:23,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 565 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 21:59:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-10-31 21:59:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1149. [2024-10-31 21:59:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 912 states have (on average 1.292763157894737) internal successors, (1179), 918 states have internal predecessors, (1179), 220 states have call successors, (220), 16 states have call predecessors, (220), 16 states have return successors, (220), 214 states have call predecessors, (220), 220 states have call successors, (220) [2024-10-31 21:59:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1619 transitions. [2024-10-31 21:59:23,331 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1619 transitions. Word has length 229 [2024-10-31 21:59:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:23,331 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1619 transitions. [2024-10-31 21:59:23,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-31 21:59:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1619 transitions. [2024-10-31 21:59:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-31 21:59:23,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:23,336 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:23,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:59:23,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:23,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1316175713, now seen corresponding path program 1 times [2024-10-31 21:59:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:23,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81240601] [2024-10-31 21:59:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:23,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:59:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:23,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:59:23,630 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:59:23,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:59:23,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:23,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:23,824 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:59:23,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:59:23 BoogieIcfgContainer [2024-10-31 21:59:23,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:59:23,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:59:23,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:59:23,829 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:59:23,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:59" (3/4) ... [2024-10-31 21:59:23,832 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:59:23,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:59:23,834 INFO L158 Benchmark]: Toolchain (without parser) took 25864.49ms. Allocated memory was 130.0MB in the beginning and 346.0MB in the end (delta: 216.0MB). Free memory was 93.9MB in the beginning and 191.3MB in the end (delta: -97.4MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,834 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:59:23,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.89ms. Allocated memory is still 130.0MB. Free memory was 93.9MB in the beginning and 76.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.91ms. Allocated memory is still 130.0MB. Free memory was 76.7MB in the beginning and 72.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,835 INFO L158 Benchmark]: Boogie Preprocessor took 90.15ms. Allocated memory is still 130.0MB. Free memory was 72.1MB in the beginning and 65.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,836 INFO L158 Benchmark]: RCFGBuilder took 1022.07ms. Allocated memory is still 130.0MB. Free memory was 65.4MB in the beginning and 81.4MB in the end (delta: -16.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,837 INFO L158 Benchmark]: TraceAbstraction took 24207.22ms. Allocated memory was 130.0MB in the beginning and 346.0MB in the end (delta: 216.0MB). Free memory was 80.8MB in the beginning and 192.4MB in the end (delta: -111.6MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-10-31 21:59:23,837 INFO L158 Benchmark]: Witness Printer took 5.34ms. Allocated memory is still 346.0MB. Free memory was 192.4MB in the beginning and 191.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:59:23,839 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.30ms. Allocated memory is still 130.0MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.89ms. Allocated memory is still 130.0MB. Free memory was 93.9MB in the beginning and 76.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.91ms. Allocated memory is still 130.0MB. Free memory was 76.7MB in the beginning and 72.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.15ms. Allocated memory is still 130.0MB. Free memory was 72.1MB in the beginning and 65.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.07ms. Allocated memory is still 130.0MB. Free memory was 65.4MB in the beginning and 81.4MB in the end (delta: -16.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24207.22ms. Allocated memory was 130.0MB in the beginning and 346.0MB in the end (delta: 216.0MB). Free memory was 80.8MB in the beginning and 192.4MB in the end (delta: -111.6MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. * Witness Printer took 5.34ms. Allocated memory is still 346.0MB. Free memory was 192.4MB in the beginning and 191.3MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed short int var_1_25 = -100; [L41] unsigned long int var_1_26 = 32; [L42] unsigned char var_1_27 = 1; [L43] unsigned long int var_1_28 = 100; [L44] unsigned long int var_1_29 = 1000000000; [L45] unsigned long int var_1_30 = 1000000000; [L46] unsigned long int var_1_31 = 10; [L47] unsigned long int var_1_32 = 10000; [L48] unsigned long int var_1_33 = 0; [L49] signed long int var_1_34 = -10; [L50] signed char var_1_35 = 25; [L51] signed char var_1_36 = -2; [L52] unsigned long int var_1_37 = 32; [L53] float var_1_38 = 4.6; [L54] float var_1_39 = 25.5; [L55] float var_1_40 = 99.25; [L56] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L192] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L137] var_1_10 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L160] var_1_25 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L163] var_1_27 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L166] var_1_28 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L169] var_1_29 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_29 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_29 >= 536870911) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_29 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_29 <= 1073741824) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_30 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 536870912) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L175] var_1_31 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L176] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L178] var_1_32 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L179] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L181] var_1_36 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L182] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L186] var_1_39 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L188] var_1_40 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L203] RET updateVariables() [L204] CALL step() [L60] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L61] COND TRUE var_1_24 <= var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L62] COND TRUE \read(var_1_27) [L63] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L70] COND FALSE !(var_1_32 != var_1_29) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L75] COND TRUE ((((((((10) < 0 ) ? -(10) : (10)))) > (var_1_24)) ? (((((10) < 0 ) ? -(10) : (10)))) : (var_1_24))) == var_1_25 [L76] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L78] COND TRUE \read(var_1_27) [L79] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L81] COND FALSE !((var_1_38 * var_1_39) <= var_1_40) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L86] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L89] var_1_20 = var_1_8 [L90] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L91] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L94] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L95] COND FALSE !(\read(var_1_22)) [L102] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L104] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L105] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L106] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L107] COND FALSE !(\read(var_1_22)) [L114] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L119] signed long int stepLocal_4 = 256; [L120] unsigned char stepLocal_3 = var_1_22; [L121] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L122] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L125] COND FALSE !(stepLocal_3 || var_1_22) [L130] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L204] RET step() [L205] CALL, EXPR property() [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195-L196] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=58, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1820 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1820 mSDsluCounter, 5658 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3199 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 2459 mSDtfsCounter, 1307 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1149occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 633 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 2476 NumberOfCodeBlocks, 2476 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2237 ConstructedInterpolants, 0 QuantifiedInterpolants, 11957 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 23800/23800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 21:59:23,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889e6cd0-d6e0-4f51-a9c4-bb89cfe1887f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...