./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu --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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:24,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:24,550 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:03:24,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:24,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:24,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:24,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:24,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:24,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:24,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:24,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:24,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:24,619 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:24,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:24,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:03:24,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:24,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:24,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:24,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:24,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:03:24,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:24,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:03:24,625 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:24,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:24,626 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:24,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:24,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:24,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:24,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:24,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:24,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:24,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:03:24,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:24,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:24,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:24,631 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:03:24,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:24,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:24,632 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:24,632 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2023-11-19 08:03:24,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:24,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:24,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:24,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:24,949 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:24,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:03:28,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:28,352 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:28,353 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:03:28,367 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/f0bf76525/7ca4fd2dd6dc4940a9c05b9f2649f2f7/FLAGea4a37ae2 [2023-11-19 08:03:28,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/f0bf76525/7ca4fd2dd6dc4940a9c05b9f2649f2f7 [2023-11-19 08:03:28,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:28,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:28,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:28,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:28,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:28,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:28,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d40c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28, skipping insertion in model container [2023-11-19 08:03:28,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:28,457 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:28,716 WARN L240 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-19 08:03:28,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:28,877 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:28,889 WARN L240 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-19 08:03:28,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:28,953 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:28,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28 WrapperNode [2023-11-19 08:03:28,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:28,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:28,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:28,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:28,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:28,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,071 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2023-11-19 08:03:29,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:29,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:29,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:29,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:29,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:29,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:29,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:29,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:29,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (1/1) ... [2023-11-19 08:03:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:29,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:29,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:29,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 08:03:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 08:03:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:29,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:29,377 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:29,380 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:30,035 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:30,045 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:30,045 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 08:03:30,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:30 BoogieIcfgContainer [2023-11-19 08:03:30,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:30,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:03:30,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:03:30,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:03:30,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:28" (1/3) ... [2023-11-19 08:03:30,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143ca2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:30, skipping insertion in model container [2023-11-19 08:03:30,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:28" (2/3) ... [2023-11-19 08:03:30,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143ca2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:30, skipping insertion in model container [2023-11-19 08:03:30,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:30" (3/3) ... [2023-11-19 08:03:30,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:03:30,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:03:30,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:03:30,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:30,190 INFO L357 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, mHoare=true, 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;@3ef5a7e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:30,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:03:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 08:03:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-19 08:03:30,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:30,224 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:30,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:30,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash 870093887, now seen corresponding path program 1 times [2023-11-19 08:03:30,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:30,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481229542] [2023-11-19 08:03:30,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:30,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:31,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481229542] [2023-11-19 08:03:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481229542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:31,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051611730] [2023-11-19 08:03:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:03:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:03:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:31,094 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-19 08:03:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:31,134 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2023-11-19 08:03:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:03:31,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2023-11-19 08:03:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:31,148 INFO L225 Difference]: With dead ends: 167 [2023-11-19 08:03:31,148 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 08:03:31,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:31,158 INFO L413 NwaCegarLoop]: 126 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, 126 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 [2023-11-19 08:03:31,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:03:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 08:03:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-19 08:03:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 08:03:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2023-11-19 08:03:31,253 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 155 [2023-11-19 08:03:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:31,253 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2023-11-19 08:03:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-19 08:03:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2023-11-19 08:03:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-19 08:03:31,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:31,260 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:03:31,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:31,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -972225851, now seen corresponding path program 1 times [2023-11-19 08:03:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807408269] [2023-11-19 08:03:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807408269] [2023-11-19 08:03:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807408269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:31,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:31,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:31,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98440588] [2023-11-19 08:03:31,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:31,794 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:31,970 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2023-11-19 08:03:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2023-11-19 08:03:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:31,976 INFO L225 Difference]: With dead ends: 231 [2023-11-19 08:03:31,976 INFO L226 Difference]: Without dead ends: 154 [2023-11-19 08:03:31,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:31,980 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 110 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:31,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 329 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:03:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-19 08:03:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 81. [2023-11-19 08:03:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 08:03:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2023-11-19 08:03:32,053 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 155 [2023-11-19 08:03:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:32,056 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2023-11-19 08:03:32,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2023-11-19 08:03:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-19 08:03:32,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:32,061 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:32,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:03:32,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:32,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1983343101, now seen corresponding path program 1 times [2023-11-19 08:03:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142865256] [2023-11-19 08:03:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142865256] [2023-11-19 08:03:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142865256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073823883] [2023-11-19 08:03:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:32,757 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:33,022 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2023-11-19 08:03:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:03:33,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2023-11-19 08:03:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:33,026 INFO L225 Difference]: With dead ends: 238 [2023-11-19 08:03:33,026 INFO L226 Difference]: Without dead ends: 160 [2023-11-19 08:03:33,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:03:33,029 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 81 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:33,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 328 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:03:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-19 08:03:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2023-11-19 08:03:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-19 08:03:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2023-11-19 08:03:33,061 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 155 [2023-11-19 08:03:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:33,062 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2023-11-19 08:03:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2023-11-19 08:03:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:33,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:33,066 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:33,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:03:33,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:33,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1913094660, now seen corresponding path program 1 times [2023-11-19 08:03:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889261157] [2023-11-19 08:03:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-19 08:03:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889261157] [2023-11-19 08:03:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889261157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616856386] [2023-11-19 08:03:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:33,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:33,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:03:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:33,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 08:03:33,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2023-11-19 08:03:34,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-19 08:03:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616856386] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:34,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-19 08:03:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169514257] [2023-11-19 08:03:34,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:34,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:03:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:03:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:03:34,523 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-11-19 08:03:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:34,828 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2023-11-19 08:03:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:03:34,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 156 [2023-11-19 08:03:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:34,834 INFO L225 Difference]: With dead ends: 258 [2023-11-19 08:03:34,834 INFO L226 Difference]: Without dead ends: 164 [2023-11-19 08:03:34,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-19 08:03:34,848 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 64 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:34,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 285 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:03:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-19 08:03:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2023-11-19 08:03:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-19 08:03:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 236 transitions. [2023-11-19 08:03:34,884 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 236 transitions. Word has length 156 [2023-11-19 08:03:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:34,885 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 236 transitions. [2023-11-19 08:03:34,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-11-19 08:03:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2023-11-19 08:03:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:34,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:34,890 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:34,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 08:03:35,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:35,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:35,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1360804282, now seen corresponding path program 1 times [2023-11-19 08:03:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839845695] [2023-11-19 08:03:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839845695] [2023-11-19 08:03:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839845695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303284877] [2023-11-19 08:03:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:35,724 INFO L87 Difference]: Start difference. First operand 158 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:35,835 INFO L93 Difference]: Finished difference Result 380 states and 558 transitions. [2023-11-19 08:03:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:03:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2023-11-19 08:03:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:35,841 INFO L225 Difference]: With dead ends: 380 [2023-11-19 08:03:35,841 INFO L226 Difference]: Without dead ends: 276 [2023-11-19 08:03:35,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:35,846 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 114 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:35,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 319 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:03:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-19 08:03:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 226. [2023-11-19 08:03:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 166 states have (on average 1.355421686746988) internal successors, (225), 167 states have internal predecessors, (225), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-19 08:03:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2023-11-19 08:03:35,923 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 156 [2023-11-19 08:03:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:35,923 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2023-11-19 08:03:35,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2023-11-19 08:03:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:35,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:35,927 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:35,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:03:35,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:35,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 633340424, now seen corresponding path program 1 times [2023-11-19 08:03:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007376503] [2023-11-19 08:03:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007376503] [2023-11-19 08:03:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007376503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:36,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276784129] [2023-11-19 08:03:36,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:36,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:36,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:36,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:36,153 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:36,239 INFO L93 Difference]: Finished difference Result 480 states and 708 transitions. [2023-11-19 08:03:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2023-11-19 08:03:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:36,246 INFO L225 Difference]: With dead ends: 480 [2023-11-19 08:03:36,246 INFO L226 Difference]: Without dead ends: 327 [2023-11-19 08:03:36,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:36,248 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 108 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 306 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 [2023-11-19 08:03:36,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 306 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:03:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-19 08:03:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2023-11-19 08:03:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 240 states have (on average 1.3458333333333334) internal successors, (323), 241 states have internal predecessors, (323), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-19 08:03:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 475 transitions. [2023-11-19 08:03:36,323 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 475 transitions. Word has length 156 [2023-11-19 08:03:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:36,326 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 475 transitions. [2023-11-19 08:03:36,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 475 transitions. [2023-11-19 08:03:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:36,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:36,329 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:36,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:03:36,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:36,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash 891505862, now seen corresponding path program 1 times [2023-11-19 08:03:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:36,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311580474] [2023-11-19 08:03:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311580474] [2023-11-19 08:03:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311580474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:03:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707132171] [2023-11-19 08:03:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:38,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:38,151 INFO L87 Difference]: Start difference. First operand 325 states and 475 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:38,718 INFO L93 Difference]: Finished difference Result 980 states and 1422 transitions. [2023-11-19 08:03:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:03:38,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2023-11-19 08:03:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:38,726 INFO L225 Difference]: With dead ends: 980 [2023-11-19 08:03:38,726 INFO L226 Difference]: Without dead ends: 738 [2023-11-19 08:03:38,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:03:38,729 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 146 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:38,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 538 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 08:03:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-11-19 08:03:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 545. [2023-11-19 08:03:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 402 states have (on average 1.2835820895522387) internal successors, (516), 404 states have internal predecessors, (516), 129 states have call successors, (129), 13 states have call predecessors, (129), 13 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-19 08:03:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 774 transitions. [2023-11-19 08:03:38,840 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 774 transitions. Word has length 156 [2023-11-19 08:03:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:38,841 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 774 transitions. [2023-11-19 08:03:38,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 774 transitions. [2023-11-19 08:03:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:38,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:38,844 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:38,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:03:38,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:38,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1284532872, now seen corresponding path program 1 times [2023-11-19 08:03:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768242982] [2023-11-19 08:03:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-19 08:03:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768242982] [2023-11-19 08:03:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768242982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390189521] [2023-11-19 08:03:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:39,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:39,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:39,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:03:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 08:03:39,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 694 proven. 72 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-11-19 08:03:40,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2023-11-19 08:03:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390189521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:41,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:41,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 30 [2023-11-19 08:03:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326969434] [2023-11-19 08:03:41,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:41,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-19 08:03:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-19 08:03:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2023-11-19 08:03:41,477 INFO L87 Difference]: Start difference. First operand 545 states and 774 transitions. Second operand has 30 states, 29 states have (on average 4.0) internal successors, (116), 28 states have internal predecessors, (116), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2023-11-19 08:03:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:43,353 INFO L93 Difference]: Finished difference Result 1585 states and 2221 transitions. [2023-11-19 08:03:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-19 08:03:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0) internal successors, (116), 28 states have internal predecessors, (116), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) Word has length 156 [2023-11-19 08:03:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:43,364 INFO L225 Difference]: With dead ends: 1585 [2023-11-19 08:03:43,364 INFO L226 Difference]: Without dead ends: 1099 [2023-11-19 08:03:43,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=891, Invalid=2415, Unknown=0, NotChecked=0, Total=3306 [2023-11-19 08:03:43,369 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 919 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:43,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 918 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 08:03:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2023-11-19 08:03:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 557. [2023-11-19 08:03:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 411 states have (on average 1.2749391727493917) internal successors, (524), 413 states have internal predecessors, (524), 129 states have call successors, (129), 16 states have call predecessors, (129), 16 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-19 08:03:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 782 transitions. [2023-11-19 08:03:43,509 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 782 transitions. Word has length 156 [2023-11-19 08:03:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:43,513 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 782 transitions. [2023-11-19 08:03:43,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0) internal successors, (116), 28 states have internal predecessors, (116), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2023-11-19 08:03:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 782 transitions. [2023-11-19 08:03:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-19 08:03:43,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:43,516 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:43,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:43,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:43,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:43,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1790500304, now seen corresponding path program 1 times [2023-11-19 08:03:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389243867] [2023-11-19 08:03:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:03:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389243867] [2023-11-19 08:03:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389243867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:44,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:03:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737025572] [2023-11-19 08:03:44,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:44,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:44,009 INFO L87 Difference]: Start difference. First operand 557 states and 782 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:44,252 INFO L93 Difference]: Finished difference Result 1077 states and 1510 transitions. [2023-11-19 08:03:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:03:44,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2023-11-19 08:03:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:44,258 INFO L225 Difference]: With dead ends: 1077 [2023-11-19 08:03:44,259 INFO L226 Difference]: Without dead ends: 590 [2023-11-19 08:03:44,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-19 08:03:44,263 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 133 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:44,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 574 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:03:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-11-19 08:03:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 556. [2023-11-19 08:03:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 410 states have (on average 1.2707317073170732) internal successors, (521), 412 states have internal predecessors, (521), 129 states have call successors, (129), 16 states have call predecessors, (129), 16 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-19 08:03:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 779 transitions. [2023-11-19 08:03:44,368 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 779 transitions. Word has length 156 [2023-11-19 08:03:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:44,369 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 779 transitions. [2023-11-19 08:03:44,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:03:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 779 transitions. [2023-11-19 08:03:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-19 08:03:44,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:44,373 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:44,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:03:44,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:44,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1853593783, now seen corresponding path program 1 times [2023-11-19 08:03:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605268012] [2023-11-19 08:03:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:03:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:03:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:03:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:03:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:03:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:03:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:03:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 08:03:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:03:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:03:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:03:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 08:03:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:03:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 08:03:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:03:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 08:03:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 08:03:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 08:03:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 08:03:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 08:03:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 08:03:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 08:03:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-19 08:03:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605268012] [2023-11-19 08:03:44,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605268012] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373564699] [2023-11-19 08:03:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:44,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:44,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:03:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:45,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 08:03:45,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-11-19 08:03:45,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-19 08:03:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373564699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:45,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2023-11-19 08:03:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411317133] [2023-11-19 08:03:45,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:45,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 08:03:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 08:03:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-11-19 08:03:45,872 INFO L87 Difference]: Start difference. First operand 556 states and 779 transitions. Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2023-11-19 08:03:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:46,831 INFO L93 Difference]: Finished difference Result 1172 states and 1616 transitions. [2023-11-19 08:03:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 08:03:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 157 [2023-11-19 08:03:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:46,837 INFO L225 Difference]: With dead ends: 1172 [2023-11-19 08:03:46,837 INFO L226 Difference]: Without dead ends: 686 [2023-11-19 08:03:46,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 08:03:46,840 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 682 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:46,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 567 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 08:03:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-11-19 08:03:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 652. [2023-11-19 08:03:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 479 states have (on average 1.2296450939457202) internal successors, (589), 485 states have internal predecessors, (589), 149 states have call successors, (149), 23 states have call predecessors, (149), 23 states have return successors, (149), 143 states have call predecessors, (149), 149 states have call successors, (149) [2023-11-19 08:03:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 887 transitions. [2023-11-19 08:03:47,022 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 887 transitions. Word has length 157 [2023-11-19 08:03:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:47,023 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 887 transitions. [2023-11-19 08:03:47,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2023-11-19 08:03:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 887 transitions. [2023-11-19 08:03:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-19 08:03:47,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:47,027 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:47,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-19 08:03:47,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:47,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:47,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1623725063, now seen corresponding path program 1 times [2023-11-19 08:03:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414022104] [2023-11-19 08:03:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:47,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:47,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:47,769 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:03:47,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 08:03:47,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:03:47,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:47,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:03:47,891 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-19 08:03:47,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-19 08:03:47,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:03:47 BoogieIcfgContainer [2023-11-19 08:03:47,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:03:47,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:03:47,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:03:47,932 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:03:47,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:30" (3/4) ... [2023-11-19 08:03:47,934 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:03:47,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:03:47,936 INFO L158 Benchmark]: Toolchain (without parser) took 19543.01ms. Allocated memory was 144.7MB in the beginning and 318.8MB in the end (delta: 174.1MB). Free memory was 108.3MB in the beginning and 167.0MB in the end (delta: -58.8MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,937 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 119.5MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:03:47,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.55ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 102.0MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.03ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 95.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,938 INFO L158 Benchmark]: Boogie Preprocessor took 97.25ms. Allocated memory is still 144.7MB. Free memory was 95.7MB in the beginning and 92.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,938 INFO L158 Benchmark]: RCFGBuilder took 883.99ms. Allocated memory is still 144.7MB. Free memory was 92.9MB in the beginning and 62.8MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,939 INFO L158 Benchmark]: TraceAbstraction took 17871.35ms. Allocated memory was 144.7MB in the beginning and 318.8MB in the end (delta: 174.1MB). Free memory was 62.2MB in the beginning and 168.1MB in the end (delta: -105.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,940 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 318.8MB. Free memory was 168.1MB in the beginning and 167.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:03:47,942 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 119.5MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.55ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 102.0MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.03ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 95.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.25ms. Allocated memory is still 144.7MB. Free memory was 95.7MB in the beginning and 92.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 883.99ms. Allocated memory is still 144.7MB. Free memory was 92.9MB in the beginning and 62.8MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17871.35ms. Allocated memory was 144.7MB in the beginning and 318.8MB in the end (delta: 174.1MB). Free memory was 62.2MB in the beginning and 168.1MB in the end (delta: -105.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 318.8MB. Free memory was 168.1MB in the beginning and 167.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseOr at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_4 = 1; [L24] double var_1_7 = 31.25; [L25] double var_1_8 = 7.6; [L26] double var_1_9 = 8.9; [L27] double var_1_10 = 256.8; [L28] signed short int var_1_11 = 0; [L29] unsigned long int var_1_15 = 64; [L30] signed short int var_1_18 = 16; [L31] signed short int var_1_19 = 22006; [L32] unsigned char var_1_21 = 1; [L33] unsigned char var_1_22 = 0; [L34] float var_1_23 = 2.25; [L35] signed long int var_1_24 = -1; [L36] unsigned char var_1_26 = 32; [L37] unsigned char var_1_27 = 200; [L38] unsigned char var_1_28 = 5; [L39] unsigned char var_1_29 = 64; [L40] unsigned char var_1_30 = 64; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 5; [L43] signed char var_1_33 = 2; [L44] signed char var_1_34 = 32; [L45] unsigned short int var_1_35 = 16; [L46] float var_1_37 = 63.5; [L47] signed long int last_1_var_1_24 = -1; [L48] unsigned char last_1_var_1_26 = 32; [L49] signed char last_1_var_1_33 = 2; [L50] unsigned short int last_1_var_1_35 = 16; VAL [isInitial=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_26 = var_1_26 [L183] last_1_var_1_33 = var_1_33 [L184] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=89/10] [L147] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=89/10] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L149] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L150] var_1_10 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L151] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L152] var_1_19 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L153] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L154] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L154] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L155] var_1_22 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L156] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L157] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L157] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L158] var_1_27 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_27 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L159] RET assume_abort_if_not(var_1_27 >= 190) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L160] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L160] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L161] var_1_28 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L162] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L163] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L163] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L164] var_1_29 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_29 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L165] RET assume_abort_if_not(var_1_29 >= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L166] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L166] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L167] var_1_30 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_30 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L168] RET assume_abort_if_not(var_1_30 >= 31) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L169] CALL assume_abort_if_not(var_1_30 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L169] RET assume_abort_if_not(var_1_30 <= 64) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L171] RET assume_abort_if_not(var_1_31 >= 32) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L172] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L172] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L175] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L175] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L176] var_1_34 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L178] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L178] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L196] RET updateVariables() [L197] CALL step() [L54] signed long int stepLocal_6 = last_1_var_1_24; [L55] unsigned char stepLocal_5 = var_1_30; [L56] signed long int stepLocal_4 = last_1_var_1_24; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L57] EXPR last_1_var_1_35 | 100000000 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L57] COND TRUE stepLocal_6 < (last_1_var_1_35 | 100000000) [L58] COND TRUE stepLocal_5 > last_1_var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L59] COND FALSE !(var_1_19 < stepLocal_4) [L62] var_1_35 = (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33)))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=37, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L74] COND TRUE \read(var_1_4) [L75] var_1_21 = (! var_1_22) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=37, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L77] COND TRUE ! var_1_21 [L78] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=32, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=37, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L80] COND TRUE (var_1_8 + 199.375) <= 10.5 [L81] var_1_26 = ((var_1_27 - var_1_28) - (var_1_29 - 1)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=2, var_1_34=4, var_1_35=37, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L89] COND TRUE \read(var_1_22) [L90] var_1_33 = ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L92] var_1_37 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L93] COND FALSE !((- var_1_8) != var_1_23) [L96] var_1_11 = ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L98] COND TRUE var_1_26 == var_1_11 [L99] var_1_15 = ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L107] COND FALSE !((var_1_11 == var_1_15) && var_1_21) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L110] signed short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=31, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L111] COND TRUE var_1_1 != stepLocal_3 [L112] var_1_18 = (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=31, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L114] COND FALSE !(var_1_18 != var_1_18) [L123] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=31, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L125] signed short int stepLocal_2 = var_1_11; [L126] signed long int stepLocal_1 = var_1_1; [L127] unsigned short int stepLocal_0 = var_1_35; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=37, stepLocal_1=-256, stepLocal_2=31, stepLocal_3=31, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006, var_1_9=100000007] [L128] COND FALSE !(stepLocal_0 == var_1_1) [L139] var_1_7 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=37, stepLocal_1=-256, stepLocal_2=31, stepLocal_3=31, stepLocal_4=-1, stepLocal_5=31, stepLocal_6=-1, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006, var_1_9=100000007] [L197] RET step() [L198] CALL, EXPR property() [L187] EXPR ((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006, var_1_9=100000007] [L187-L188] return (((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28))))) && (var_1_37 == ((float) var_1_10)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006, var_1_9=100000007] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=31, var_1_15=37, var_1_18=-32727, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=31, var_1_26=31, var_1_27=190, var_1_28=33, var_1_29=127, var_1_30=31, var_1_31=63, var_1_32=0, var_1_33=92, var_1_34=4, var_1_35=37, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006, var_1_9=100000007] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2365 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2357 mSDsluCounter, 4290 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2929 mSDsCounter, 808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1829 IncrementalHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 808 mSolverCounterUnsat, 1361 mSDtfsCounter, 1829 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1532 GetRequests, 1408 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=10, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 944 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 8350 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 15772/16192 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 [2023-11-19 08:03:47,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu --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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:50,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:50,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 08:03:50,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:50,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:50,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:50,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:50,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:50,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:50,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:50,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:50,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:50,909 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:50,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:50,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:03:50,912 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:50,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:50,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:50,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:03:50,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:50,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:03:50,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:03:50,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:03:50,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:03:50,916 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:50,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:50,917 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:50,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:50,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:50,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:50,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:50,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:50,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:50,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:03:50,921 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:03:50,922 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:03:50,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:50,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:03:50,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:50,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:50,924 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:03:50,924 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:50,924 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2023-11-19 08:03:51,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:51,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:51,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:51,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:51,404 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:51,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:03:54,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:55,125 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:55,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:03:55,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/f9a4590e5/c73a3dceb76642cba8eb1e68e069d5a4/FLAGa156f18c9 [2023-11-19 08:03:55,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/data/f9a4590e5/c73a3dceb76642cba8eb1e68e069d5a4 [2023-11-19 08:03:55,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:55,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:55,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:55,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:55,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:55,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123fc994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55, skipping insertion in model container [2023-11-19 08:03:55,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,218 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:55,400 WARN L240 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-19 08:03:55,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:55,604 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:55,627 WARN L240 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_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-19 08:03:55,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:55,801 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:55,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55 WrapperNode [2023-11-19 08:03:55,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:55,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:55,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:55,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:55,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,907 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2023-11-19 08:03:55,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:55,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:55,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:55,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:55,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:55,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:56,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:56,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:56,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:56,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:56,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (1/1) ... [2023-11-19 08:03:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:56,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:56,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 08:03:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 08:03:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 08:03:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:56,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:56,208 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:56,210 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:00,683 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:00,702 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:00,703 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 08:04:00,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:00 BoogieIcfgContainer [2023-11-19 08:04:00,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:00,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:00,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:00,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:00,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:55" (1/3) ... [2023-11-19 08:04:00,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382430a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:00, skipping insertion in model container [2023-11-19 08:04:00,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:55" (2/3) ... [2023-11-19 08:04:00,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382430a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:00, skipping insertion in model container [2023-11-19 08:04:00,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:00" (3/3) ... [2023-11-19 08:04:00,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-19 08:04:00,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:00,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:04:00,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:00,844 INFO L357 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, mHoare=true, 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;@755114fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:00,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:04:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 08:04:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 08:04:00,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:00,881 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:00,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:00,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1838406269, now seen corresponding path program 1 times [2023-11-19 08:04:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:04:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704280164] [2023-11-19 08:04:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:00,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 08:04:00,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:04:00,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 08:04:00,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 08:04:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:01,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 08:04:01,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2023-11-19 08:04:01,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:04:01,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:04:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704280164] [2023-11-19 08:04:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704280164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386427925] [2023-11-19 08:04:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:01,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:04:01,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:01,718 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-19 08:04:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:01,760 INFO L93 Difference]: Finished difference Result 153 states and 264 transitions. [2023-11-19 08:04:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2023-11-19 08:04:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:01,774 INFO L225 Difference]: With dead ends: 153 [2023-11-19 08:04:01,774 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 08:04:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:01,784 INFO L413 NwaCegarLoop]: 116 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, 116 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 [2023-11-19 08:04:01,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:04:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 08:04:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 08:04:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 08:04:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2023-11-19 08:04:01,847 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2023-11-19 08:04:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:01,848 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2023-11-19 08:04:01,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-19 08:04:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2023-11-19 08:04:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 08:04:01,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:01,854 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:01,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:04:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 08:04:02,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:02,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1130403401, now seen corresponding path program 1 times [2023-11-19 08:04:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:04:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987092456] [2023-11-19 08:04:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 08:04:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:04:02,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 08:04:02,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d9c08f0-1be8-4b7f-9545-86653d6aa9bf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 08:04:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:02,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 08:04:02,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-19 08:04:03,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:04:03,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:04:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987092456] [2023-11-19 08:04:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987092456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:03,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570721543] [2023-11-19 08:04:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:03,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:04:03,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:03,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:03,846 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-19 08:04:06,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 08:04:08,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 08:04:10,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 08:04:12,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 08:04:14,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []