./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:33,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:34,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:34,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:34,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:34,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:34,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:34,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:34,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:34,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:34,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:34,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:34,099 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:34,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:34,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:34,102 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:34,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:34,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:34,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:34,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:34,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:34,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:34,107 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:34,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:34,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:34,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:34,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:34,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:34,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:34,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:34,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:34,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:34,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:34,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:34,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:34,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:34,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:34,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:34,115 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:34,116 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_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2023-11-06 21:14:34,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:34,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:34,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:34,442 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:34,443 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:34,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:14:37,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:37,812 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:37,812 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:14:37,824 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/8bb28776a/3dda778f95ff41ab96ecfe98f5b725a2/FLAG2f21e2a60 [2023-11-06 21:14:37,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/8bb28776a/3dda778f95ff41ab96ecfe98f5b725a2 [2023-11-06 21:14:37,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:37,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:37,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:37,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:37,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:37,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4970d403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37, skipping insertion in model container [2023-11-06 21:14:37,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:38,116 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_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2023-11-06 21:14:38,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:38,226 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:38,245 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_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2023-11-06 21:14:38,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:38,358 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:38,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:38 WrapperNode [2023-11-06 21:14:38,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:38,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:38,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:38,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:38,368 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:38" (1/1) ... [2023-11-06 21:14:38,398 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:38" (1/1) ... [2023-11-06 21:14:38,459 INFO L138 Inliner]: procedures = 29, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 583 [2023-11-06 21:14:38,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:38,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:38,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:38,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:38,472 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:38" (1/1) ... [2023-11-06 21:14:38,472 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:38" (1/1) ... [2023-11-06 21:14:38,478 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:38" (1/1) ... [2023-11-06 21:14:38,478 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:38" (1/1) ... [2023-11-06 21:14:38,508 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:38" (1/1) ... [2023-11-06 21:14:38,514 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:38" (1/1) ... [2023-11-06 21:14:38,517 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:38" (1/1) ... [2023-11-06 21:14:38,521 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:38" (1/1) ... [2023-11-06 21:14:38,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:38,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:38,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:38,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:38,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:38" (1/1) ... [2023-11-06 21:14:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:38,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:38,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:38,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:14:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:14:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:14:38,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:38,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:38,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:38,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:38,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:38,816 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:38,818 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:39,551 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:39,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:39,564 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:39,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:39 BoogieIcfgContainer [2023-11-06 21:14:39,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:39,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:39,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:39,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:39,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:37" (1/3) ... [2023-11-06 21:14:39,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34339af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:39, skipping insertion in model container [2023-11-06 21:14:39,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:38" (2/3) ... [2023-11-06 21:14:39,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34339af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:39, skipping insertion in model container [2023-11-06 21:14:39,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:39" (3/3) ... [2023-11-06 21:14:39,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:14:39,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:39,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:39,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:39,664 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;@29ed4e1c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:39,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:14:39,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:39,690 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:39,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 79458764, now seen corresponding path program 1 times [2023-11-06 21:14:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424881865] [2023-11-06 21:14:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424881865] [2023-11-06 21:14:40,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424881865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839253341] [2023-11-06 21:14:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:40,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:40,310 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:14:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:40,360 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2023-11-06 21:14:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2023-11-06 21:14:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:40,372 INFO L225 Difference]: With dead ends: 271 [2023-11-06 21:14:40,373 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 21:14:40,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:40,380 INFO L413 NwaCegarLoop]: 198 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, 198 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:40,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 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:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 21:14:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-06 21:14:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2023-11-06 21:14:40,439 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2023-11-06 21:14:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:40,440 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2023-11-06 21:14:40,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:14:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2023-11-06 21:14:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:14:40,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:40,446 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:14:40,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:40,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 509231968, now seen corresponding path program 1 times [2023-11-06 21:14:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495589153] [2023-11-06 21:14:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495589153] [2023-11-06 21:14:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495589153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256047386] [2023-11-06 21:14:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:40,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:40,875 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:14:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:40,998 INFO L93 Difference]: Finished difference Result 273 states and 402 transitions. [2023-11-06 21:14:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:41,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2023-11-06 21:14:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:41,003 INFO L225 Difference]: With dead ends: 273 [2023-11-06 21:14:41,003 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 21:14:41,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:41,006 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:41,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 579 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 21:14:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-11-06 21:14:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2023-11-06 21:14:41,048 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2023-11-06 21:14:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:41,049 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2023-11-06 21:14:41,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:14:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2023-11-06 21:14:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:14:41,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:41,056 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:14:41,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:41,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 145765470, now seen corresponding path program 1 times [2023-11-06 21:14:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665463211] [2023-11-06 21:14:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665463211] [2023-11-06 21:14:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665463211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532096094] [2023-11-06 21:14:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:41,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:41,564 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:41,646 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2023-11-06 21:14:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:41,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2023-11-06 21:14:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:41,655 INFO L225 Difference]: With dead ends: 304 [2023-11-06 21:14:41,655 INFO L226 Difference]: Without dead ends: 170 [2023-11-06 21:14:41,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:41,665 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 87 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:41,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 611 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-06 21:14:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2023-11-06 21:14:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2023-11-06 21:14:41,690 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2023-11-06 21:14:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:41,694 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2023-11-06 21:14:41,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2023-11-06 21:14:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:14:41,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:41,705 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:14:41,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:41,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:41,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1498114201, now seen corresponding path program 1 times [2023-11-06 21:14:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:41,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548880643] [2023-11-06 21:14:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548880643] [2023-11-06 21:14:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548880643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445356520] [2023-11-06 21:14:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:42,025 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:42,074 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2023-11-06 21:14:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-06 21:14:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:42,078 INFO L225 Difference]: With dead ends: 309 [2023-11-06 21:14:42,079 INFO L226 Difference]: Without dead ends: 173 [2023-11-06 21:14:42,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:42,091 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 72 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:42,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 598 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-06 21:14:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 141. [2023-11-06 21:14:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2023-11-06 21:14:42,115 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2023-11-06 21:14:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:42,116 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2023-11-06 21:14:42,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2023-11-06 21:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:14:42,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:42,119 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:14:42,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:42,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 911308187, now seen corresponding path program 1 times [2023-11-06 21:14:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587700859] [2023-11-06 21:14:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587700859] [2023-11-06 21:14:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587700859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807220643] [2023-11-06 21:14:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:42,358 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:42,394 INFO L93 Difference]: Finished difference Result 291 states and 422 transitions. [2023-11-06 21:14:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:42,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-06 21:14:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:42,397 INFO L225 Difference]: With dead ends: 291 [2023-11-06 21:14:42,397 INFO L226 Difference]: Without dead ends: 153 [2023-11-06 21:14:42,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:42,399 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 21 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:42,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 581 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-06 21:14:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2023-11-06 21:14:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2023-11-06 21:14:42,412 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2023-11-06 21:14:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:42,413 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2023-11-06 21:14:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2023-11-06 21:14:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:14:42,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:42,416 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:14:42,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:42,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1591366557, now seen corresponding path program 1 times [2023-11-06 21:14:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283401220] [2023-11-06 21:14:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283401220] [2023-11-06 21:14:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283401220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773362430] [2023-11-06 21:14:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:42,654 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:42,701 INFO L93 Difference]: Finished difference Result 291 states and 420 transitions. [2023-11-06 21:14:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:42,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-06 21:14:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:42,703 INFO L225 Difference]: With dead ends: 291 [2023-11-06 21:14:42,703 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 21:14:42,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:42,707 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 12 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:42,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 579 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 21:14:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2023-11-06 21:14:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2023-11-06 21:14:42,730 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2023-11-06 21:14:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:42,731 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2023-11-06 21:14:42,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2023-11-06 21:14:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:14:42,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:42,734 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:14:42,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:42,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -928593377, now seen corresponding path program 1 times [2023-11-06 21:14:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:42,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374493853] [2023-11-06 21:14:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:14:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374493853] [2023-11-06 21:14:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374493853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977328499] [2023-11-06 21:14:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:42,981 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:43,019 INFO L93 Difference]: Finished difference Result 291 states and 418 transitions. [2023-11-06 21:14:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-06 21:14:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:43,022 INFO L225 Difference]: With dead ends: 291 [2023-11-06 21:14:43,022 INFO L226 Difference]: Without dead ends: 149 [2023-11-06 21:14:43,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:43,024 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 3 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:43,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 578 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-06 21:14:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2023-11-06 21:14:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:14:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2023-11-06 21:14:43,034 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2023-11-06 21:14:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:43,036 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2023-11-06 21:14:43,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:14:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2023-11-06 21:14:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:14:43,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:43,039 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:14:43,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:43,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -926746335, now seen corresponding path program 1 times [2023-11-06 21:14:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265872285] [2023-11-06 21:14:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:14:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:14:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:14:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:14:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:14:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 21:14:45,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265872285] [2023-11-06 21:14:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265872285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:14:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694496408] [2023-11-06 21:14:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:45,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:45,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:14:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:45,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-06 21:14:45,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:45,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:45,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 107 [2023-11-06 21:14:46,106 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:46,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 107 [2023-11-06 21:14:46,499 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:46,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 107 [2023-11-06 21:14:46,876 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:46,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 98 [2023-11-06 21:14:47,530 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:47,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 101 treesize of output 109 [2023-11-06 21:14:47,915 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:47,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 101 treesize of output 100 [2023-11-06 21:14:48,367 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:48,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 97 [2023-11-06 21:14:48,754 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:48,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 97 [2023-11-06 21:14:49,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:49,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 88 [2023-11-06 21:14:49,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:49,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 76 [2023-11-06 21:14:49,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:49,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 73 [2023-11-06 21:14:50,037 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:50,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 82 [2023-11-06 21:14:50,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:50,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 88 [2023-11-06 21:14:50,487 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:14:50,488 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 108 treesize of output 38 [2023-11-06 21:14:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 2 proven. 506 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 21:14:50,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 21:14:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694496408] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:51,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:14:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 12] total 32 [2023-11-06 21:14:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905003079] [2023-11-06 21:14:51,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 21:14:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 21:14:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2023-11-06 21:14:51,933 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 32 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 32 states have internal predecessors, (202), 14 states have call successors, (54), 7 states have call predecessors, (54), 9 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2023-11-06 21:14:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:59,646 INFO L93 Difference]: Finished difference Result 873 states and 1224 transitions. [2023-11-06 21:14:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-06 21:14:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 32 states have internal predecessors, (202), 14 states have call successors, (54), 7 states have call predecessors, (54), 9 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) Word has length 158 [2023-11-06 21:14:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:59,653 INFO L225 Difference]: With dead ends: 873 [2023-11-06 21:14:59,653 INFO L226 Difference]: Without dead ends: 729 [2023-11-06 21:14:59,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2206 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1275, Invalid=6207, Unknown=0, NotChecked=0, Total=7482 [2023-11-06 21:14:59,658 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 2063 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 4095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:59,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 1957 Invalid, 4095 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [268 Valid, 3827 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-06 21:14:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-11-06 21:14:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 475. [2023-11-06 21:14:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 406 states have (on average 1.3522167487684729) internal successors, (549), 407 states have internal predecessors, (549), 57 states have call successors, (57), 11 states have call predecessors, (57), 11 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:14:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2023-11-06 21:14:59,718 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 158 [2023-11-06 21:14:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:59,719 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2023-11-06 21:14:59,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 32 states have internal predecessors, (202), 14 states have call successors, (54), 7 states have call predecessors, (54), 9 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2023-11-06 21:14:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2023-11-06 21:14:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:14:59,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:59,722 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 21:14:59,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 21:14:59,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:59,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1377135848, now seen corresponding path program 1 times [2023-11-06 21:14:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081684409] [2023-11-06 21:14:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:02,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081684409] [2023-11-06 21:15:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081684409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841027598] [2023-11-06 21:15:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:02,005 INFO L87 Difference]: Start difference. First operand 475 states and 663 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:02,732 INFO L93 Difference]: Finished difference Result 869 states and 1212 transitions. [2023-11-06 21:15:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:02,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-06 21:15:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:02,739 INFO L225 Difference]: With dead ends: 869 [2023-11-06 21:15:02,739 INFO L226 Difference]: Without dead ends: 543 [2023-11-06 21:15:02,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:02,741 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 186 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:02,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 674 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:15:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2023-11-06 21:15:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 489. [2023-11-06 21:15:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 419 states have internal predecessors, (561), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:15:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 675 transitions. [2023-11-06 21:15:02,807 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 675 transitions. Word has length 160 [2023-11-06 21:15:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:02,808 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 675 transitions. [2023-11-06 21:15:02,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 675 transitions. [2023-11-06 21:15:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:15:02,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:02,810 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:15:02,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:02,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1963941862, now seen corresponding path program 1 times [2023-11-06 21:15:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410235127] [2023-11-06 21:15:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410235127] [2023-11-06 21:15:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410235127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279110314] [2023-11-06 21:15:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:03,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:03,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:03,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:03,375 INFO L87 Difference]: Start difference. First operand 489 states and 675 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:04,025 INFO L93 Difference]: Finished difference Result 1241 states and 1712 transitions. [2023-11-06 21:15:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2023-11-06 21:15:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:04,036 INFO L225 Difference]: With dead ends: 1241 [2023-11-06 21:15:04,036 INFO L226 Difference]: Without dead ends: 888 [2023-11-06 21:15:04,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:04,038 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 241 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:04,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 981 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:15:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2023-11-06 21:15:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 533. [2023-11-06 21:15:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 463 states have internal predecessors, (618), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:15:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 732 transitions. [2023-11-06 21:15:04,134 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 732 transitions. Word has length 160 [2023-11-06 21:15:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:04,135 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 732 transitions. [2023-11-06 21:15:04,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 732 transitions. [2023-11-06 21:15:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:15:04,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:04,138 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:15:04,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:04,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -817488188, now seen corresponding path program 1 times [2023-11-06 21:15:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:04,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897751765] [2023-11-06 21:15:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897751765] [2023-11-06 21:15:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897751765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:05,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865636861] [2023-11-06 21:15:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:05,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:05,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:05,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:05,960 INFO L87 Difference]: Start difference. First operand 533 states and 732 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:06,844 INFO L93 Difference]: Finished difference Result 861 states and 1185 transitions. [2023-11-06 21:15:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-06 21:15:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:06,851 INFO L225 Difference]: With dead ends: 861 [2023-11-06 21:15:06,851 INFO L226 Difference]: Without dead ends: 689 [2023-11-06 21:15:06,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:15:06,857 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 282 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:06,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 795 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-11-06 21:15:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 562. [2023-11-06 21:15:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 491 states have (on average 1.3441955193482689) internal successors, (660), 492 states have internal predecessors, (660), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:15:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 774 transitions. [2023-11-06 21:15:06,933 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 774 transitions. Word has length 160 [2023-11-06 21:15:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:06,934 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 774 transitions. [2023-11-06 21:15:06,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 774 transitions. [2023-11-06 21:15:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:15:06,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:06,937 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:15:06,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:06,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -115888314, now seen corresponding path program 1 times [2023-11-06 21:15:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412333750] [2023-11-06 21:15:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412333750] [2023-11-06 21:15:07,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412333750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:07,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:07,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:15:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590047964] [2023-11-06 21:15:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:07,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:15:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:15:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:15:07,950 INFO L87 Difference]: Start difference. First operand 562 states and 774 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:09,025 INFO L93 Difference]: Finished difference Result 1118 states and 1545 transitions. [2023-11-06 21:15:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:15:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2023-11-06 21:15:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:09,034 INFO L225 Difference]: With dead ends: 1118 [2023-11-06 21:15:09,034 INFO L226 Difference]: Without dead ends: 919 [2023-11-06 21:15:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:15:09,037 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 423 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:09,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 633 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2023-11-06 21:15:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 562. [2023-11-06 21:15:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 491 states have (on average 1.3441955193482689) internal successors, (660), 492 states have internal predecessors, (660), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:15:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 774 transitions. [2023-11-06 21:15:09,150 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 774 transitions. Word has length 160 [2023-11-06 21:15:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:09,151 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 774 transitions. [2023-11-06 21:15:09,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 774 transitions. [2023-11-06 21:15:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 21:15:09,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:09,154 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:15:09,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:09,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1143106471, now seen corresponding path program 1 times [2023-11-06 21:15:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:09,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572179115] [2023-11-06 21:15:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572179115] [2023-11-06 21:15:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572179115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:15:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168983490] [2023-11-06 21:15:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:10,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:15:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:15:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:15:10,384 INFO L87 Difference]: Start difference. First operand 562 states and 774 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:11,568 INFO L93 Difference]: Finished difference Result 1054 states and 1440 transitions. [2023-11-06 21:15:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:15:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2023-11-06 21:15:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:11,573 INFO L225 Difference]: With dead ends: 1054 [2023-11-06 21:15:11,573 INFO L226 Difference]: Without dead ends: 652 [2023-11-06 21:15:11,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:15:11,576 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 617 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:11,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 496 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-11-06 21:15:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 565. [2023-11-06 21:15:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 494 states have (on average 1.3421052631578947) internal successors, (663), 495 states have internal predecessors, (663), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 21:15:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 777 transitions. [2023-11-06 21:15:11,667 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 777 transitions. Word has length 163 [2023-11-06 21:15:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:11,668 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 777 transitions. [2023-11-06 21:15:11,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 777 transitions. [2023-11-06 21:15:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 21:15:11,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:11,671 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:15:11,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:11,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1729912485, now seen corresponding path program 1 times [2023-11-06 21:15:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232528792] [2023-11-06 21:15:11,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232528792] [2023-11-06 21:15:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232528792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266361789] [2023-11-06 21:15:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:13,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:13,513 INFO L87 Difference]: Start difference. First operand 565 states and 777 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:14,587 INFO L93 Difference]: Finished difference Result 808 states and 1130 transitions. [2023-11-06 21:15:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:15:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2023-11-06 21:15:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:14,595 INFO L225 Difference]: With dead ends: 808 [2023-11-06 21:15:14,596 INFO L226 Difference]: Without dead ends: 806 [2023-11-06 21:15:14,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:15:14,597 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 203 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:14,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 906 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2023-11-06 21:15:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 461. [2023-11-06 21:15:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 392 states have (on average 1.316326530612245) internal successors, (516), 393 states have internal predecessors, (516), 54 states have call successors, (54), 14 states have call predecessors, (54), 14 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 21:15:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 624 transitions. [2023-11-06 21:15:14,735 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 624 transitions. Word has length 163 [2023-11-06 21:15:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 624 transitions. [2023-11-06 21:15:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:15:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 624 transitions. [2023-11-06 21:15:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 21:15:14,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:14,740 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:15:14,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:14,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1731759527, now seen corresponding path program 1 times [2023-11-06 21:15:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501042581] [2023-11-06 21:15:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501042581] [2023-11-06 21:15:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501042581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584192694] [2023-11-06 21:15:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:15,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:15,256 INFO L87 Difference]: Start difference. First operand 461 states and 624 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:15,592 INFO L93 Difference]: Finished difference Result 848 states and 1147 transitions. [2023-11-06 21:15:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2023-11-06 21:15:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:15,597 INFO L225 Difference]: With dead ends: 848 [2023-11-06 21:15:15,597 INFO L226 Difference]: Without dead ends: 473 [2023-11-06 21:15:15,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:15,599 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 129 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:15,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 338 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:15:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-06 21:15:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2023-11-06 21:15:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 401 states have (on average 1.3042394014962593) internal successors, (523), 402 states have internal predecessors, (523), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 21:15:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 631 transitions. [2023-11-06 21:15:15,701 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 631 transitions. Word has length 163 [2023-11-06 21:15:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:15,702 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 631 transitions. [2023-11-06 21:15:15,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 631 transitions. [2023-11-06 21:15:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 21:15:15,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:15,706 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:15:15,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:15,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash -788200407, now seen corresponding path program 1 times [2023-11-06 21:15:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868265956] [2023-11-06 21:15:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868265956] [2023-11-06 21:15:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868265956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076210901] [2023-11-06 21:15:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:16,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:16,107 INFO L87 Difference]: Start difference. First operand 473 states and 631 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:16,513 INFO L93 Difference]: Finished difference Result 856 states and 1149 transitions. [2023-11-06 21:15:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:16,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2023-11-06 21:15:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:16,518 INFO L225 Difference]: With dead ends: 856 [2023-11-06 21:15:16,518 INFO L226 Difference]: Without dead ends: 473 [2023-11-06 21:15:16,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:16,521 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:16,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 283 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:15:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-06 21:15:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2023-11-06 21:15:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 401 states have (on average 1.2992518703241895) internal successors, (521), 402 states have internal predecessors, (521), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 21:15:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 629 transitions. [2023-11-06 21:15:16,639 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 629 transitions. Word has length 163 [2023-11-06 21:15:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:16,640 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 629 transitions. [2023-11-06 21:15:16,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 629 transitions. [2023-11-06 21:15:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 21:15:16,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:16,643 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:15:16,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:16,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -108142037, now seen corresponding path program 1 times [2023-11-06 21:15:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413327028] [2023-11-06 21:15:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 21:15:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 21:15:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:15:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:15:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:15:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:15:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:15:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:15:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:15:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 21:15:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413327028] [2023-11-06 21:15:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413327028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:16,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237603590] [2023-11-06 21:15:16,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:16,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:16,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:16,888 INFO L87 Difference]: Start difference. First operand 473 states and 629 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:17,015 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2023-11-06 21:15:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:17,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2023-11-06 21:15:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:17,019 INFO L225 Difference]: With dead ends: 872 [2023-11-06 21:15:17,019 INFO L226 Difference]: Without dead ends: 489 [2023-11-06 21:15:17,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:17,021 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 23 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:17,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 753 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-06 21:15:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 479. [2023-11-06 21:15:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 407 states have (on average 1.2948402948402948) internal successors, (527), 408 states have internal predecessors, (527), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 21:15:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 635 transitions. [2023-11-06 21:15:17,121 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 635 transitions. Word has length 163 [2023-11-06 21:15:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:17,122 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 635 transitions. [2023-11-06 21:15:17,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 21:15:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 635 transitions. [2023-11-06 21:15:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [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 [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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: SelfDestructingSolverStorable16 [2023-11-06 21:15:17,127 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 714531706, 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,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951871143] [2023-11-06 21:15:17,128 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,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:17,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:15:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:17,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:15:17,358 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:15:17,360 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:15:17,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:15:17,366 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:17,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:15:17,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:15:17 BoogieIcfgContainer [2023-11-06 21:15:17,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:15:17,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:15:17,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:15:17,490 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:15:17,490 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:39" (3/4) ... [2023-11-06 21:15:17,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:15:17,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:15:17,494 INFO L158 Benchmark]: Toolchain (without parser) took 39637.87ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 115.8MB in the beginning and 519.4MB in the end (delta: -403.6MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,494 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:17,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.71ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 96.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.10ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 92.0MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,495 INFO L158 Benchmark]: Boogie Preprocessor took 67.41ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 88.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,495 INFO L158 Benchmark]: RCFGBuilder took 1038.77ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 121.5MB in the end (delta: -33.1MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,496 INFO L158 Benchmark]: TraceAbstraction took 37915.93ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 121.5MB in the beginning and 519.4MB in the end (delta: -397.9MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2023-11-06 21:15:17,496 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 599.8MB. Free memory is still 519.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:17,498 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.27ms. Allocated memory is still 119.5MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.71ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 96.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.10ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 92.0MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.41ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 88.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1038.77ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 121.5MB in the end (delta: -33.1MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37915.93ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 121.5MB in the beginning and 519.4MB in the end (delta: -397.9MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 599.8MB. Free memory is still 519.4MB. 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 119. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] signed short int last_1_WrapperStruct00_var_1_21 = 256; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_21 [L116] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )=1, WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F=1, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )=1, WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F=1, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )=1, WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F=1, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )=1, WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F=1, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00.var_1_6=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00.var_1_6=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00.var_1_8=4294967318, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )=1, WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F=1, WrapperStruct00.var_1_8=4294967318, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )=1, WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F=1, WrapperStruct00.var_1_8=4294967318, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=4294967294, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00.var_1_14=4294967294, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=4294967294, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00.var_1_14=4294967294, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00.var_1_16=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00.var_1_16=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L102] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00.var_1_17=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00.var_1_17=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00.var_1_17=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00.var_1_17=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=6, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00.var_1_18=6, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=6, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00.var_1_18=6, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00.var_1_20=63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00.var_1_20=63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00.var_1_20=63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00.var_1_20=63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET updateVariables() [L128] CALL step() [L67] EXPR WrapperStruct00.var_1_14 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L68] WrapperStruct00.var_1_21 = last_1_WrapperStruct00_var_1_21 [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_23 = WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR WrapperStruct00.var_1_3 [L71] EXPR WrapperStruct00.var_1_4 VAL [((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] COND FALSE !(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) [L74] EXPR WrapperStruct00.var_1_22 [L74] signed char stepLocal_0 = WrapperStruct00.var_1_22; [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00.var_1_21=256, WrapperStruct00.var_1_22=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) VAL [((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)=20, WrapperStruct00.var_1_21=256, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L75] COND FALSE !(stepLocal_0 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L78] EXPR WrapperStruct00.var_1_8 VAL [((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L78] COND FALSE !(WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) [L81] EXPR WrapperStruct00.var_1_22 [L81] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_22 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1 VAL [(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_3 VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_8 VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_15 VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) [L119] EXPR WrapperStruct00.var_1_15 VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) VAL [(((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) VAL [(((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=1, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) VAL [(((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [(((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1) VAL [((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)=0, (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [(((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))=0, ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)=0, (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16)) VAL [((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))=0, (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))=0, ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)=0, (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [(((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6))=0, ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))=0, (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))=0, ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)=0, (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))=10, ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))=0, (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1=1, (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)=10, ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2)=11/10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=10, ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)=4294967310, (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))=0, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_15=-10, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_22=20, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_2=4294967310, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_3=4294967313, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_4=4294967309, WrapperStruct00.var_1_7=20, WrapperStruct00.var_1_8=4294967318, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119-L120] return (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4557 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4531 mSDsluCounter, 11540 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8522 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8024 IncrementalHoareTripleChecker+Invalid, 8606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 3018 mSDtfsCounter, 8024 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1189 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565occurred in iteration=13, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1674 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 3038 NumberOfCodeBlocks, 3038 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3010 ConstructedInterpolants, 0 QuantifiedInterpolants, 22371 SizeOfPredicates, 14 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 11044/11628 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:17,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:20,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:20,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:15:20,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:20,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:20,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:20,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:20,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:20,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:20,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:20,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:20,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:20,599 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:20,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:20,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:15:20,602 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:20,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:20,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:20,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:15:20,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:20,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:15:20,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:15:20,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:15:20,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:15:20,607 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:20,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:15:20,608 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:20,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:20,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:20,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:20,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:20,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:20,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:20,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:15:20,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:15:20,613 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:15:20,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:20,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:15:20,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:20,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:20,615 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:15:20,615 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:20,616 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_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2023-11-06 21:15:21,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:21,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:21,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:21,155 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:21,156 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:21,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:15:24,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:24,685 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:24,685 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:15:24,696 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/29e26d9ce/e7bcf37de57a400383b9062d4237bb52/FLAG746c8abd3 [2023-11-06 21:15:24,712 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/data/29e26d9ce/e7bcf37de57a400383b9062d4237bb52 [2023-11-06 21:15:24,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:24,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:24,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:24,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:24,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:24,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:24" (1/1) ... [2023-11-06 21:15:24,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9948ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:24, skipping insertion in model container [2023-11-06 21:15:24,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:24" (1/1) ... [2023-11-06 21:15:24,757 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:24,913 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_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2023-11-06 21:15:24,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:25,017 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:25,036 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_0360c849-20ac-44a0-bd38-b252db367e09/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2023-11-06 21:15:25,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:25,192 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:25,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:25 WrapperNode [2023-11-06 21:15:25,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:25,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:25,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:25,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:25,204 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:25" (1/1) ... [2023-11-06 21:15:25,243 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:25" (1/1) ... [2023-11-06 21:15:25,305 INFO L138 Inliner]: procedures = 36, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2023-11-06 21:15:25,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:25,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:25,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:25,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:25,317 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:25" (1/1) ... [2023-11-06 21:15:25,317 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:25" (1/1) ... [2023-11-06 21:15:25,327 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:25" (1/1) ... [2023-11-06 21:15:25,328 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:25" (1/1) ... [2023-11-06 21:15:25,360 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:25" (1/1) ... [2023-11-06 21:15:25,366 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:25" (1/1) ... [2023-11-06 21:15:25,371 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:25" (1/1) ... [2023-11-06 21:15:25,376 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:25" (1/1) ... [2023-11-06 21:15:25,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:25,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:25,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:25,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:25,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:25" (1/1) ... [2023-11-06 21:15:25,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:25,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:25,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:15:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:15:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:15:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:15:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:15:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:15:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:15:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:15:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:15:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:15:25,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:15:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:15:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:15:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:15:25,705 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:25,707 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:29,464 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:29,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:29,485 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:15:29,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:29 BoogieIcfgContainer [2023-11-06 21:15:29,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:29,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:29,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:29,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:29,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:24" (1/3) ... [2023-11-06 21:15:29,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448ba395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:29, skipping insertion in model container [2023-11-06 21:15:29,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:25" (2/3) ... [2023-11-06 21:15:29,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448ba395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:29, skipping insertion in model container [2023-11-06 21:15:29,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:29" (3/3) ... [2023-11-06 21:15:29,503 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2023-11-06 21:15:29,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:29,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:15:29,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:29,590 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;@37849240, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:29,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:15:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 21:15:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:15:29,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:29,617 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:29,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -16098142, now seen corresponding path program 1 times [2023-11-06 21:15:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:15:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957159262] [2023-11-06 21:15:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:29,638 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:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:15:29,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:29,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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:30,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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)] Ended with exit code 139 [2023-11-06 21:15:30,021 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_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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:30,026 INFO L158 Benchmark]: Toolchain (without parser) took 5309.18ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 55.7MB in the beginning and 48.4MB in the end (delta: 7.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,027 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 55.0MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:30,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.31ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.96ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 49.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,033 INFO L158 Benchmark]: Boogie Preprocessor took 77.67ms. Allocated memory is still 79.7MB. Free memory was 49.5MB in the beginning and 45.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,038 INFO L158 Benchmark]: RCFGBuilder took 4103.88ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 45.1MB in the beginning and 75.1MB in the end (delta: -30.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,040 INFO L158 Benchmark]: TraceAbstraction took 532.16ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 48.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:30,047 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.33ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 55.0MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.31ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.96ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 49.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.67ms. Allocated memory is still 79.7MB. Free memory was 49.5MB in the beginning and 45.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 4103.88ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 45.1MB in the beginning and 75.1MB in the end (delta: -30.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * TraceAbstraction took 532.16ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 48.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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:30,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0360c849-20ac-44a0-bd38-b252db367e09/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_0360c849-20ac-44a0-bd38-b252db367e09/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.