./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:52,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:52,863 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:52,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:52,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:52,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:52,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:52,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:52,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:52,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:52,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:52,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:52,922 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:52,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:52,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:52,925 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:52,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:52,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:52,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:52,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:52,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:52,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:52,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:52,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:52,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:52,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:52,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:52,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:52,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:52,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:52,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:52,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:52,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:52,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:52,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:52,937 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:52,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:52,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:52,938 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:52,938 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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2023-11-06 21:14:53,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:53,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:53,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:53,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:53,285 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:53,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:14:56,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:56,643 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:56,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:14:56,654 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/750fcb75e/57e9ab839c0c4fa3bf5787d4c7fec02a/FLAG825cdbc41 [2023-11-06 21:14:56,672 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/750fcb75e/57e9ab839c0c4fa3bf5787d4c7fec02a [2023-11-06 21:14:56,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:56,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:56,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:56,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:56,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:56,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:56" (1/1) ... [2023-11-06 21:14:56,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788abf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:56, skipping insertion in model container [2023-11-06 21:14:56,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:56" (1/1) ... [2023-11-06 21:14:56,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:56,935 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_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2023-11-06 21:14:57,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:57,058 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:57,074 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_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2023-11-06 21:14:57,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:57,157 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:57,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57 WrapperNode [2023-11-06 21:14:57,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:57,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:57,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:57,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:57,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,246 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2023-11-06 21:14:57,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:57,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:57,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:57,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:57,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:57,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:57,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:57,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:57,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:57,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:57,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:57,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:57,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:14:57,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:14:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:14:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:57,628 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:57,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:58,362 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:58,370 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:58,381 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:58,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:58 BoogieIcfgContainer [2023-11-06 21:14:58,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:58,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:58,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:58,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:58,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:56" (1/3) ... [2023-11-06 21:14:58,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7ef19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:58, skipping insertion in model container [2023-11-06 21:14:58,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (2/3) ... [2023-11-06 21:14:58,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7ef19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:58, skipping insertion in model container [2023-11-06 21:14:58,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:58" (3/3) ... [2023-11-06 21:14:58,399 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:14:58,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:58,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:58,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:58,509 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=LoopsAndPotentialCycles, 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;@3df41349, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:58,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 92 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 21:14:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 21:14:58,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:58,534 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:14:58,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:58,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1936231246, now seen corresponding path program 1 times [2023-11-06 21:14:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:58,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960586546] [2023-11-06 21:14:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:14:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:14:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:14:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960586546] [2023-11-06 21:14:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960586546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117180015] [2023-11-06 21:14:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:59,092 INFO L87 Difference]: Start difference. First operand has 103 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 92 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:14:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:59,155 INFO L93 Difference]: Finished difference Result 199 states and 307 transitions. [2023-11-06 21:14:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2023-11-06 21:14:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:59,168 INFO L225 Difference]: With dead ends: 199 [2023-11-06 21:14:59,168 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 21:14:59,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-06 21:14:59,177 INFO L413 NwaCegarLoop]: 144 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, 144 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-06 21:14:59,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 21:14:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 21:14:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 21:14:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2023-11-06 21:14:59,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 90 [2023-11-06 21:14:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:59,234 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2023-11-06 21:14:59,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:14:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2023-11-06 21:14:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 21:14:59,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:59,240 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:14:59,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:14:59,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:59,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 52153652, now seen corresponding path program 1 times [2023-11-06 21:14:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145647701] [2023-11-06 21:14:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:00,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145647701] [2023-11-06 21:15:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145647701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:00,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:00,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346005595] [2023-11-06 21:15:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:00,990 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:01,708 INFO L93 Difference]: Finished difference Result 345 states and 505 transitions. [2023-11-06 21:15:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:01,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2023-11-06 21:15:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:01,713 INFO L225 Difference]: With dead ends: 345 [2023-11-06 21:15:01,714 INFO L226 Difference]: Without dead ends: 249 [2023-11-06 21:15:01,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:15:01,717 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 327 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:01,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 345 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:15:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-06 21:15:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 146. [2023-11-06 21:15:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2023-11-06 21:15:01,752 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 90 [2023-11-06 21:15:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:01,752 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2023-11-06 21:15:01,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2023-11-06 21:15:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 21:15:01,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:01,757 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:01,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:01,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:01,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -412572258, now seen corresponding path program 1 times [2023-11-06 21:15:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:01,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596670168] [2023-11-06 21:15:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596670168] [2023-11-06 21:15:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596670168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:01,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:01,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991605771] [2023-11-06 21:15:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:01,931 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:02,008 INFO L93 Difference]: Finished difference Result 241 states and 350 transitions. [2023-11-06 21:15:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2023-11-06 21:15:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:02,012 INFO L225 Difference]: With dead ends: 241 [2023-11-06 21:15:02,012 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 21:15:02,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-06 21:15:02,015 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:02,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:15:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 21:15:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-11-06 21:15:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2023-11-06 21:15:02,041 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 91 [2023-11-06 21:15:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:02,042 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2023-11-06 21:15:02,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2023-11-06 21:15:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 21:15:02,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:02,053 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:02,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:02,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:02,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:02,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2005785755, now seen corresponding path program 1 times [2023-11-06 21:15:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295970975] [2023-11-06 21:15:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 21:15:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295970975] [2023-11-06 21:15:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295970975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79108614] [2023-11-06 21:15:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:04,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:04,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:15:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:04,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 21:15:04,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:04,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-06 21:15:05,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-06 21:15:05,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2023-11-06 21:15:05,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 21:15:05,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:05,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 21:15:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 21:15:06,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:06,290 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_205 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse0 (mod (+ 65520 (select (select .cse1 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset)) 65536))) (or (= .cse0 (+ (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 65536)) (< .cse0 32768))))) (forall ((v_ArrVal_205 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse3 (mod (+ 65520 (select (select .cse2 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset)) 65536))) (or (= (select (select .cse2 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) .cse3) (< 32767 .cse3)))))) is different from false [2023-11-06 21:15:06,378 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse0 (mod (+ 65520 (select (select .cse1 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset)) 65536))) (or (< 32767 .cse0) (= .cse0 (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse2 (mod (+ 65520 (select (select .cse3 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset)) 65536))) (or (< .cse2 32768) (= (+ 65536 (select (select .cse3 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)) .cse2)))))) is different from false [2023-11-06 21:15:06,796 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~var_1_1_Pointer~0.base)) (.cse0 (mod (+ (select (select |c_#memory_int| c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset) 65520) 65536))) (and (or (< 32767 .cse0) (and (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store .cse3 ~var_1_1_Pointer~0.offset .cse0)) c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse1 (mod (+ (select (select .cse2 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset) 65520) 65536))) (or (< .cse1 32768) (= .cse1 (+ 65536 (select (select .cse2 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))))))) (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store .cse3 ~var_1_1_Pointer~0.offset .cse0)) c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse4 (mod (+ (select (select .cse5 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset) 65520) 65536))) (or (< 32767 .cse4) (= .cse4 (select (select .cse5 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))))) (or (let ((.cse8 (+ .cse0 (- 65536)))) (and (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store .cse3 ~var_1_1_Pointer~0.offset .cse8)) c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse6 (mod (+ (select (select .cse7 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset) 65520) 65536))) (or (= .cse6 (+ 65536 (select (select .cse7 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (< .cse6 32768))))) (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store .cse3 ~var_1_1_Pointer~0.offset .cse8)) c_~var_1_11_Pointer~0.base v_ArrVal_204) c_~var_1_7_Pointer~0.base v_ArrVal_205))) (let ((.cse9 (mod (+ (select (select .cse10 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset) 65520) 65536))) (or (= .cse9 (select (select .cse10 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (< 32767 .cse9))))))) (< .cse0 32768)))) is different from false [2023-11-06 21:15:06,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:07,006 INFO L322 Elim1Store]: treesize reduction 21, result has 61.1 percent of original size [2023-11-06 21:15:07,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 79 [2023-11-06 21:15:07,037 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:07,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 935 treesize of output 866 [2023-11-06 21:15:07,108 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:07,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 381 treesize of output 371 [2023-11-06 21:15:07,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:07,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 338 [2023-11-06 21:15:07,958 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:07,994 INFO L322 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2023-11-06 21:15:07,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 67 [2023-11-06 21:15:08,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,019 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:08,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2023-11-06 21:15:08,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,074 INFO L322 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-06 21:15:08,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 75 [2023-11-06 21:15:08,110 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:08,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 869 treesize of output 800 [2023-11-06 21:15:08,179 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:08,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 330 [2023-11-06 21:15:08,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:08,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 315 [2023-11-06 21:15:08,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,898 INFO L322 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2023-11-06 21:15:08,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 67 [2023-11-06 21:15:08,906 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,907 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:15:08,917 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:08,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2023-11-06 21:15:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79108614] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:09,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:15:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 11] total 32 [2023-11-06 21:15:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245161157] [2023-11-06 21:15:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:09,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:15:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:09,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:15:09,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=712, Unknown=3, NotChecked=168, Total=992 [2023-11-06 21:15:09,417 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:10,301 INFO L93 Difference]: Finished difference Result 320 states and 460 transitions. [2023-11-06 21:15:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:10,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2023-11-06 21:15:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:10,307 INFO L225 Difference]: With dead ends: 320 [2023-11-06 21:15:10,307 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 21:15:10,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=141, Invalid=990, Unknown=3, NotChecked=198, Total=1332 [2023-11-06 21:15:10,310 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 301 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:10,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 468 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 741 Unchecked, 0.3s Time] [2023-11-06 21:15:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 21:15:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 164. [2023-11-06 21:15:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3846153846153846) internal successors, (198), 143 states have internal predecessors, (198), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 234 transitions. [2023-11-06 21:15:10,331 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 234 transitions. Word has length 94 [2023-11-06 21:15:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:10,332 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 234 transitions. [2023-11-06 21:15:10,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 234 transitions. [2023-11-06 21:15:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 21:15:10,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:10,343 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:10,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:10,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:10,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:10,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 368430365, now seen corresponding path program 1 times [2023-11-06 21:15:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227521497] [2023-11-06 21:15:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227521497] [2023-11-06 21:15:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227521497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771316844] [2023-11-06 21:15:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:11,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:11,341 INFO L87 Difference]: Start difference. First operand 164 states and 234 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:11,544 INFO L93 Difference]: Finished difference Result 346 states and 498 transitions. [2023-11-06 21:15:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-11-06 21:15:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:11,548 INFO L225 Difference]: With dead ends: 346 [2023-11-06 21:15:11,548 INFO L226 Difference]: Without dead ends: 231 [2023-11-06 21:15:11,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:11,549 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 114 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:11,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 576 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:15:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-06 21:15:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 160. [2023-11-06 21:15:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2023-11-06 21:15:11,568 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 95 [2023-11-06 21:15:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:11,568 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2023-11-06 21:15:11,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2023-11-06 21:15:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 21:15:11,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:11,571 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:11,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:15:11,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:11,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1742032735, now seen corresponding path program 1 times [2023-11-06 21:15:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453706068] [2023-11-06 21:15:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:11,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453706068] [2023-11-06 21:15:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453706068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:11,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:11,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620466299] [2023-11-06 21:15:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:11,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:11,769 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:11,798 INFO L93 Difference]: Finished difference Result 271 states and 389 transitions. [2023-11-06 21:15:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-11-06 21:15:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:11,801 INFO L225 Difference]: With dead ends: 271 [2023-11-06 21:15:11,802 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 21:15:11,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-06 21:15:11,804 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:11,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 21:15:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-11-06 21:15:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 139 states have internal predecessors, (191), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 227 transitions. [2023-11-06 21:15:11,824 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 227 transitions. Word has length 95 [2023-11-06 21:15:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:11,826 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 227 transitions. [2023-11-06 21:15:11,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 227 transitions. [2023-11-06 21:15:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 21:15:11,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:11,828 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:15:11,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:11,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash 734021110, now seen corresponding path program 1 times [2023-11-06 21:15:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357852318] [2023-11-06 21:15:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357852318] [2023-11-06 21:15:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357852318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:15:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452547405] [2023-11-06 21:15:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:13,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:15:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:15:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:15:13,484 INFO L87 Difference]: Start difference. First operand 160 states and 227 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:14,281 INFO L93 Difference]: Finished difference Result 410 states and 586 transitions. [2023-11-06 21:15:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:15:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-11-06 21:15:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:14,284 INFO L225 Difference]: With dead ends: 410 [2023-11-06 21:15:14,285 INFO L226 Difference]: Without dead ends: 299 [2023-11-06 21:15:14,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:15:14,286 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 379 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:14,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 879 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:15:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-06 21:15:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 181. [2023-11-06 21:15:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.375) internal successors, (220), 160 states have internal predecessors, (220), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2023-11-06 21:15:14,306 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 96 [2023-11-06 21:15:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:14,307 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2023-11-06 21:15:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2023-11-06 21:15:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 21:15:14,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:14,309 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:15:14,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:14,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1626680385, now seen corresponding path program 1 times [2023-11-06 21:15:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724127077] [2023-11-06 21:15:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724127077] [2023-11-06 21:15:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724127077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529997651] [2023-11-06 21:15:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:14,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:14,689 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:14,707 INFO L93 Difference]: Finished difference Result 294 states and 418 transitions. [2023-11-06 21:15:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-11-06 21:15:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:14,709 INFO L225 Difference]: With dead ends: 294 [2023-11-06 21:15:14,709 INFO L226 Difference]: Without dead ends: 175 [2023-11-06 21:15:14,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-06 21:15:14,710 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 40 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:14,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 228 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-06 21:15:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-11-06 21:15:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 154 states have internal predecessors, (208), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2023-11-06 21:15:14,728 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 96 [2023-11-06 21:15:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:14,729 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2023-11-06 21:15:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2023-11-06 21:15:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 21:15:14,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:14,732 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:15:14,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:14,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1676822116, now seen corresponding path program 1 times [2023-11-06 21:15:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:14,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693958945] [2023-11-06 21:15:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:15,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:15,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693958945] [2023-11-06 21:15:15,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693958945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:15,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:15,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160844106] [2023-11-06 21:15:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:15,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:15,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:15,659 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:16,256 INFO L93 Difference]: Finished difference Result 420 states and 590 transitions. [2023-11-06 21:15:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:16,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-11-06 21:15:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:16,260 INFO L225 Difference]: With dead ends: 420 [2023-11-06 21:15:16,260 INFO L226 Difference]: Without dead ends: 311 [2023-11-06 21:15:16,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:15:16,261 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 166 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:16,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 450 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:15:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-06 21:15:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 187. [2023-11-06 21:15:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2023-11-06 21:15:16,285 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 97 [2023-11-06 21:15:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:16,285 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2023-11-06 21:15:16,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2023-11-06 21:15:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 21:15:16,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:16,288 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:15:16,288 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:16,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1614782502, now seen corresponding path program 1 times [2023-11-06 21:15:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081903711] [2023-11-06 21:15:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081903711] [2023-11-06 21:15:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081903711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:16,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807896712] [2023-11-06 21:15:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:16,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:16,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:16,792 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:15:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:17,102 INFO L93 Difference]: Finished difference Result 312 states and 437 transitions. [2023-11-06 21:15:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:17,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2023-11-06 21:15:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:17,105 INFO L225 Difference]: With dead ends: 312 [2023-11-06 21:15:17,105 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 21:15:17,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:15:17,107 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 241 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:17,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 385 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:15:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 21:15:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2023-11-06 21:15:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 169 states have internal predecessors, (226), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2023-11-06 21:15:17,125 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 97 [2023-11-06 21:15:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:17,125 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2023-11-06 21:15:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:15:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2023-11-06 21:15:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 21:15:17,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:17,127 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:17,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:15:17,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:17,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1395927784, now seen corresponding path program 1 times [2023-11-06 21:15:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126107794] [2023-11-06 21:15:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126107794] [2023-11-06 21:15:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126107794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:15:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107903199] [2023-11-06 21:15:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:15:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:15:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:15:18,321 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:19,312 INFO L93 Difference]: Finished difference Result 383 states and 534 transitions. [2023-11-06 21:15:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:15:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-11-06 21:15:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:19,315 INFO L225 Difference]: With dead ends: 383 [2023-11-06 21:15:19,316 INFO L226 Difference]: Without dead ends: 271 [2023-11-06 21:15:19,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:15:19,317 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 153 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:19,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 602 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-06 21:15:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 199. [2023-11-06 21:15:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.3370786516853932) internal successors, (238), 178 states have internal predecessors, (238), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2023-11-06 21:15:19,336 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 97 [2023-11-06 21:15:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:19,337 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2023-11-06 21:15:19,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2023-11-06 21:15:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 21:15:19,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:19,339 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:15:19,339 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:19,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 598216922, now seen corresponding path program 1 times [2023-11-06 21:15:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306906961] [2023-11-06 21:15:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 21:15:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306906961] [2023-11-06 21:15:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306906961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 21:15:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097496545] [2023-11-06 21:15:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:20,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:15:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:15:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:15:20,451 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:21,511 INFO L93 Difference]: Finished difference Result 400 states and 556 transitions. [2023-11-06 21:15:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:15:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-11-06 21:15:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:21,514 INFO L225 Difference]: With dead ends: 400 [2023-11-06 21:15:21,514 INFO L226 Difference]: Without dead ends: 286 [2023-11-06 21:15:21,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:15:21,515 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 150 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:21,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 615 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-06 21:15:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 199. [2023-11-06 21:15:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.3314606741573034) internal successors, (237), 178 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2023-11-06 21:15:21,535 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 97 [2023-11-06 21:15:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:21,535 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2023-11-06 21:15:21,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 21:15:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2023-11-06 21:15:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 21:15:21,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:21,537 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:21,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:15:21,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:21,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 255011921, now seen corresponding path program 1 times [2023-11-06 21:15:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304374360] [2023-11-06 21:15:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 21:15:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304374360] [2023-11-06 21:15:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304374360] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673842111] [2023-11-06 21:15:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:23,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:23,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:15:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:23,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 21:15:23,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:24,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:15:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:24,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:25,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:25,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:25,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:25,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:25,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:25,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:25,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:25,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:26,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:26,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:15:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 21:15:26,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:26,505 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~last_1_var_1_11~0 4294967296))) (and (or (< 50 .cse0) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (< .cse0 (mod (select (select (store (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_600) c_~var_1_1_Pointer~0.base v_ArrVal_601) c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset) 65536)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (< 50 (mod (select (select (store (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_600) c_~var_1_1_Pointer~0.base v_ArrVal_601) c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset) 65536))) (< .cse0 51)))) is different from false [2023-11-06 21:15:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673842111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:26,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:15:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2023-11-06 21:15:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908933283] [2023-11-06 21:15:26,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:26,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 21:15:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 21:15:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=849, Unknown=2, NotChecked=62, Total=1122 [2023-11-06 21:15:26,561 INFO L87 Difference]: Start difference. First operand 199 states and 273 transitions. Second operand has 30 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 14 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-06 21:15:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:28,250 INFO L93 Difference]: Finished difference Result 394 states and 541 transitions. [2023-11-06 21:15:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:15:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 14 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) Word has length 98 [2023-11-06 21:15:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:28,252 INFO L225 Difference]: With dead ends: 394 [2023-11-06 21:15:28,253 INFO L226 Difference]: Without dead ends: 267 [2023-11-06 21:15:28,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=348, Invalid=1214, Unknown=2, NotChecked=76, Total=1640 [2023-11-06 21:15:28,255 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 336 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:28,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 819 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:15:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-06 21:15:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 208. [2023-11-06 21:15:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.3225806451612903) internal successors, (246), 186 states have internal predecessors, (246), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 282 transitions. [2023-11-06 21:15:28,276 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 282 transitions. Word has length 98 [2023-11-06 21:15:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:28,277 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 282 transitions. [2023-11-06 21:15:28,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 14 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-06 21:15:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 282 transitions. [2023-11-06 21:15:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 21:15:28,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:28,279 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:28,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:28,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:28,486 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:28,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash 36157203, now seen corresponding path program 1 times [2023-11-06 21:15:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:28,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752662132] [2023-11-06 21:15:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:15:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:15:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:15:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-06 21:15:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752662132] [2023-11-06 21:15:30,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752662132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:30,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 21:15:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854243622] [2023-11-06 21:15:30,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:30,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:15:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:15:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:15:30,077 INFO L87 Difference]: Start difference. First operand 208 states and 282 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 21:15:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:31,321 INFO L93 Difference]: Finished difference Result 392 states and 533 transitions. [2023-11-06 21:15:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:15:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 98 [2023-11-06 21:15:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:31,324 INFO L225 Difference]: With dead ends: 392 [2023-11-06 21:15:31,324 INFO L226 Difference]: Without dead ends: 269 [2023-11-06 21:15:31,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2023-11-06 21:15:31,326 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 160 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:31,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 633 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:15:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-06 21:15:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 216. [2023-11-06 21:15:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.305699481865285) internal successors, (252), 193 states have internal predecessors, (252), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 288 transitions. [2023-11-06 21:15:31,349 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 288 transitions. Word has length 98 [2023-11-06 21:15:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:31,349 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 288 transitions. [2023-11-06 21:15:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 21:15:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 288 transitions. [2023-11-06 21:15:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 21:15:31,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:31,351 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:31,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:15:31,352 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:31,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1703919512, now seen corresponding path program 1 times [2023-11-06 21:15:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791429275] [2023-11-06 21:15:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:31,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:15:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:31,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:15:31,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:15:31,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:15:31,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:15:31,895 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:31,899 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:15:32,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:15:32 BoogieIcfgContainer [2023-11-06 21:15:32,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:15:32,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:15:32,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:15:32,095 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:15:32,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:58" (3/4) ... [2023-11-06 21:15:32,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:15:32,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:15:32,099 INFO L158 Benchmark]: Toolchain (without parser) took 35419.08ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 112.1MB in the beginning and 256.8MB in the end (delta: -144.6MB). Peak memory consumption was 185.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,100 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:32,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.24ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 98.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.60ms. Allocated memory is still 159.4MB. Free memory was 98.2MB in the beginning and 95.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,101 INFO L158 Benchmark]: Boogie Preprocessor took 90.49ms. Allocated memory is still 159.4MB. Free memory was 95.0MB in the beginning and 92.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,102 INFO L158 Benchmark]: RCFGBuilder took 1045.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 92.0MB in the beginning and 157.5MB in the end (delta: -65.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,104 INFO L158 Benchmark]: TraceAbstraction took 33707.05ms. Allocated memory was 192.9MB in the beginning and 488.6MB in the end (delta: 295.7MB). Free memory was 156.4MB in the beginning and 257.8MB in the end (delta: -101.4MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:32,105 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 488.6MB. Free memory was 257.8MB in the beginning and 256.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:32,112 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.28ms. Allocated memory is still 159.4MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.24ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 98.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.60ms. Allocated memory is still 159.4MB. Free memory was 98.2MB in the beginning and 95.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.49ms. Allocated memory is still 159.4MB. Free memory was 95.0MB in the beginning and 92.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1045.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 92.0MB in the beginning and 157.5MB in the end (delta: -65.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33707.05ms. Allocated memory was 192.9MB in the beginning and 488.6MB in the end (delta: 295.7MB). Free memory was 156.4MB in the beginning and 257.8MB in the end (delta: -101.4MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 488.6MB. Free memory was 257.8MB in the beginning and 256.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of bitwiseAnd at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned short int var_1_5 = 256; [L27] unsigned short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 44772; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] float var_1_7 = 5.9; [L31] float* var_1_7_Pointer = &(var_1_7); [L32] float var_1_8 = 7.6; [L33] float* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 64.2; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] float var_1_10 = 128.75; [L37] float* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 8; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 3135928546; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] signed short int last_1_var_1_1 = -5; [L43] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR \read(var_1_1) [L93] last_1_var_1_1 = var_1_1 [L94] EXPR \read(var_1_11) [L94] last_1_var_1_11 = var_1_11 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L76] var_1_4 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_4) VAL [\read(var_1_4)=257, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [\read(var_1_4)=257, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_4) VAL [\read(var_1_4)=257, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_4 <= 1) VAL [\read(var_1_4)=257, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] var_1_6 = __VERIFIER_nondet_ushort() [L80] EXPR \read(var_1_6) VAL [\read(var_1_6)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_6 >= 32767) VAL [\read(var_1_6)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_6) VAL [\read(var_1_6)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_6 <= 65534) VAL [\read(var_1_6)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_8 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [\read(var_1_8)=3135928572, \read(var_1_8)=3135928572, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [(var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )=1, \read(var_1_8)=3135928572, \read(var_1_8)=3135928572, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F=1, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [(var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )=1, \read(var_1_8)=3135928572, \read(var_1_8)=3135928572, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F=1, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_9 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [\read(var_1_9)=3135928573, \read(var_1_9)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [(var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )=1, \read(var_1_9)=3135928573, \read(var_1_9)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F=1, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [(var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )=1, \read(var_1_9)=3135928573, \read(var_1_9)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F=1, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [\read(var_1_10)=3135928578, \read(var_1_10)=3135928578, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (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 [(var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )=1, \read(var_1_10)=3135928578, \read(var_1_10)=3135928578, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] 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_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] 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 [(var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )=1, \read(var_1_10)=3135928578, \read(var_1_10)=3135928578, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_12 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_12) VAL [\read(var_1_12)=-32212254721, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [\read(var_1_12)=-32212254721, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_12) VAL [\read(var_1_12)=-32212254721, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [\read(var_1_12)=-32212254721, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET updateVariables() [L106] CALL step() [L47] signed long int stepLocal_0 = last_1_var_1_1; [L48] EXPR \read(*var_1_4_Pointer) VAL [\read(*var_1_4_Pointer)=257, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] COND TRUE (*(var_1_4_Pointer)) [L49] (*(var_1_5_Pointer)) = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_5_Pointer) VAL [\read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND TRUE (*(var_1_5_Pointer)) == (*(var_1_5_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] (*(var_1_1_Pointer)) = ((*(var_1_5_Pointer)) + -16) [L62] EXPR \read(*var_1_5_Pointer) VAL [\read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR (*(var_1_5_Pointer)) & last_1_var_1_11 VAL [(*(var_1_5_Pointer)) & last_1_var_1_11=0, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11) [L63] EXPR \read(*var_1_6_Pointer) VAL [\read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, \read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR \read(*var_1_12_Pointer) VAL [((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, \read(*var_1_12_Pointer)=-32212254721, \read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) [L63] EXPR \read(*var_1_6_Pointer) VAL [((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, \read(*var_1_12_Pointer)=-32212254721, \read(*var_1_6_Pointer)=-2, \read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, \read(*var_1_12_Pointer)=-32212254721, \read(*var_1_6_Pointer)=-2, \read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) VAL [((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11))=8, ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))=8, \read(*var_1_12_Pointer)=-32212254721, \read(*var_1_6_Pointer)=-2, \read(*var_1_6_Pointer)=-2, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] (*(var_1_11_Pointer)) = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))) [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_5_Pointer) VAL [\read(*var_1_1_Pointer)=-21, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE (*(var_1_1_Pointer)) < (*(var_1_5_Pointer)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_7_Pointer)) = (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [\read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) VAL [((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, \read(*var_1_1_Pointer)=-21, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) [L97] EXPR \read(*var_1_4_Pointer) VAL [(((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) VAL [(((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [(((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)=1, (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_1_Pointer)=-21, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 [L97] EXPR \read(*var_1_7_Pointer) [L97] EXPR \read(*var_1_8_Pointer) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 VAL [((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)=1, (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1=0, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_10_Pointer)=3135928578, \read(*var_1_1_Pointer)=-21, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_7_Pointer)=3135928575, \read(*var_1_8_Pointer)=3135928572, \read(*var_1_9_Pointer)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)=0, (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1=0, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_10_Pointer)=3135928578, \read(*var_1_1_Pointer)=-21, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_7_Pointer)=3135928575, \read(*var_1_8_Pointer)=3135928572, \read(*var_1_9_Pointer)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [(((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11))))=0, ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)=0, (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))=1, ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1=0, ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)=1, (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)=1, \read(*var_1_10_Pointer)=3135928578, \read(*var_1_1_Pointer)=-21, \read(*var_1_1_Pointer)=-21, \read(*var_1_4_Pointer)=257, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_5_Pointer)=-5, \read(*var_1_7_Pointer)=3135928575, \read(*var_1_8_Pointer)=3135928572, \read(*var_1_9_Pointer)=3135928573, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97-L98] return (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 15, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2402 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2395 mSDsluCounter, 6636 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 741 IncrementalHoareTripleChecker+Unchecked, 5051 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5516 IncrementalHoareTripleChecker+Invalid, 6415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1585 mSDtfsCounter, 5516 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 579 SyntacticMatches, 3 SemanticMatches, 187 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=14, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 758 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 1623 NumberOfCodeBlocks, 1623 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1600 ConstructedInterpolants, 12 QuantifiedInterpolants, 15547 SizeOfPredicates, 45 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 2260/2448 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-06 21:15:32,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:34,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:34,853 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:15:34,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:34,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:34,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:34,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:34,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:34,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:34,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:34,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:34,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:34,904 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:34,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:34,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:15:34,906 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:34,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:34,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:34,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:15:34,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:34,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:15:34,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:15:34,910 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:15:34,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:15:34,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:34,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:15:34,913 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:34,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:34,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:34,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:34,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:34,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:34,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:34,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:15:34,917 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:15:34,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:15:34,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:34,918 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:15:34,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:34,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:34,919 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:15:34,919 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:34,920 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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2023-11-06 21:15:35,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:35,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:35,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:35,298 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:35,299 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:35,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:15:38,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:38,726 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:38,727 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:15:38,737 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/f5e8a9772/93c35264493e4e2e972c109a4c5a6e29/FLAGf02d10745 [2023-11-06 21:15:38,761 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/data/f5e8a9772/93c35264493e4e2e972c109a4c5a6e29 [2023-11-06 21:15:38,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:38,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:38,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:38,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:38,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:38,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:38" (1/1) ... [2023-11-06 21:15:38,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25283755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:38, skipping insertion in model container [2023-11-06 21:15:38,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:38" (1/1) ... [2023-11-06 21:15:38,825 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:39,015 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_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2023-11-06 21:15:39,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:39,137 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:39,151 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_dddbf8da-7284-415b-a877-7e019590520e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2023-11-06 21:15:39,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:39,245 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:39,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39 WrapperNode [2023-11-06 21:15:39,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:39,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:39,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:39,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:39,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,344 INFO L138 Inliner]: procedures = 36, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 377 [2023-11-06 21:15:39,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:39,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:39,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:39,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:39,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:39,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:39,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:39,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:39,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (1/1) ... [2023-11-06 21:15:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:39,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:15:39,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:15:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:15:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:15:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:15:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:15:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:15:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:15:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:15:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:15:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:15:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:15:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:15:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:15:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:15:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:15:39,752 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:39,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:42,750 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:42,760 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:42,761 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:15:42,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:42 BoogieIcfgContainer [2023-11-06 21:15:42,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:42,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:42,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:42,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:42,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:38" (1/3) ... [2023-11-06 21:15:42,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743ae648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:42, skipping insertion in model container [2023-11-06 21:15:42,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:39" (2/3) ... [2023-11-06 21:15:42,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743ae648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:42, skipping insertion in model container [2023-11-06 21:15:42,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:42" (3/3) ... [2023-11-06 21:15:42,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2023-11-06 21:15:42,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:42,801 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:15:42,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:42,874 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=LoopsAndPotentialCycles, 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;@5412acec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:42,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:15:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 21:15:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 21:15:42,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:42,898 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 21:15:42,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:42,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1037497833, now seen corresponding path program 1 times [2023-11-06 21:15:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:15:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034095635] [2023-11-06 21:15:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:42,932 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-06 21:15:42,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:15:42,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:15:42,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:15:43,297 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 21:15:43,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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 139 [2023-11-06 21:15:43,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:15:43,498 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 21:15:43,503 INFO L158 Benchmark]: Toolchain (without parser) took 4736.28ms. Allocated memory is still 119.5MB. Free memory was 95.0MB in the beginning and 58.4MB in the end (delta: 36.6MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,503 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:43,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.68ms. Allocated memory is still 119.5MB. Free memory was 94.6MB in the beginning and 79.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.22ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 76.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,506 INFO L158 Benchmark]: Boogie Preprocessor took 103.43ms. Allocated memory is still 119.5MB. Free memory was 76.3MB in the beginning and 73.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,507 INFO L158 Benchmark]: RCFGBuilder took 3311.33ms. Allocated memory is still 119.5MB. Free memory was 73.2MB in the beginning and 80.6MB in the end (delta: -7.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,508 INFO L158 Benchmark]: TraceAbstraction took 735.09ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 58.4MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:43,511 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.28ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.68ms. Allocated memory is still 119.5MB. Free memory was 94.6MB in the beginning and 79.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.22ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 76.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.43ms. Allocated memory is still 119.5MB. Free memory was 76.3MB in the beginning and 73.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3311.33ms. Allocated memory is still 119.5MB. Free memory was 73.2MB in the beginning and 80.6MB in the end (delta: -7.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 735.09ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 58.4MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:15:43,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dddbf8da-7284-415b-a877-7e019590520e/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.