./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:06,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:06,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:08:06,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:06,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:06,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:06,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:06,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:06,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:06,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:06,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:06,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:06,417 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:06,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:06,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:06,420 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:06,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:06,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:06,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:06,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:06,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:06,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:06,424 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:06,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:06,425 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:06,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:06,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:06,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:06,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:06,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:06,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:06,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:06,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:08:06,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:08:06,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:06,430 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:06,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:06,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:06,431 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:06,431 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 -> 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 [2023-11-06 23:08:06,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:06,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:06,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:06,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:06,819 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:06,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:08:09,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:10,142 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:10,143 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:08:10,153 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/ad1e631b5/94435d171e9740cfb3b52f7e57dc1577/FLAGb295ce92d [2023-11-06 23:08:10,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/ad1e631b5/94435d171e9740cfb3b52f7e57dc1577 [2023-11-06 23:08:10,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:10,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:10,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:10,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:10,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:10,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3edce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10, skipping insertion in model container [2023-11-06 23:08:10,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,213 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:10,378 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-11-06 23:08:10,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:10,456 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:10,471 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-11-06 23:08:10,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:10,546 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:10,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10 WrapperNode [2023-11-06 23:08:10,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:10,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:10,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:10,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:10,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,654 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2023-11-06 23:08:10,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:10,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:10,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:10,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:10,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:10,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:10,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:10,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:10,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (1/1) ... [2023-11-06 23:08:10,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:10,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:10,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 23:08:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:08:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 23:08:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:08:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 23:08:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:08:10,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:08:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:08:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:10,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:11,017 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:11,019 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:11,737 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:11,750 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:11,750 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:08:11,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:11 BoogieIcfgContainer [2023-11-06 23:08:11,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:11,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:11,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:11,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:11,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:10" (1/3) ... [2023-11-06 23:08:11,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7d08b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:11, skipping insertion in model container [2023-11-06 23:08:11,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:10" (2/3) ... [2023-11-06 23:08:11,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7d08b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:11, skipping insertion in model container [2023-11-06 23:08:11,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:11" (3/3) ... [2023-11-06 23:08:11,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:08:11,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:11,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:08:11,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:11,852 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;@6c849ead, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:11,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:08:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:08:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 23:08:11,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:11,877 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:11,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:11,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1212346061, now seen corresponding path program 1 times [2023-11-06 23:08:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:11,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830389593] [2023-11-06 23:08:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830389593] [2023-11-06 23:08:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830389593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:12,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:12,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164354593] [2023-11-06 23:08:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:12,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:12,858 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:12,949 INFO L93 Difference]: Finished difference Result 329 states and 512 transitions. [2023-11-06 23:08:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 23:08:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:12,963 INFO L225 Difference]: With dead ends: 329 [2023-11-06 23:08:12,963 INFO L226 Difference]: Without dead ends: 183 [2023-11-06 23:08:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 23:08:12,972 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 720 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 23:08:12,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 720 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-06 23:08:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2023-11-06 23:08:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:08:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2023-11-06 23:08:13,035 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2023-11-06 23:08:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:13,037 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2023-11-06 23:08:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2023-11-06 23:08:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 23:08:13,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:13,042 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:13,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:08:13,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:13,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -500527483, now seen corresponding path program 1 times [2023-11-06 23:08:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644793301] [2023-11-06 23:08:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644793301] [2023-11-06 23:08:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644793301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:13,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774904983] [2023-11-06 23:08:13,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:13,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:13,269 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:13,314 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2023-11-06 23:08:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:13,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-06 23:08:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:13,331 INFO L225 Difference]: With dead ends: 368 [2023-11-06 23:08:13,331 INFO L226 Difference]: Without dead ends: 224 [2023-11-06 23:08:13,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:13,337 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:13,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-06 23:08:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2023-11-06 23:08:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:08:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2023-11-06 23:08:13,363 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 135 [2023-11-06 23:08:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:13,364 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2023-11-06 23:08:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2023-11-06 23:08:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 23:08:13,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:13,368 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:08:13,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:13,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1678409010, now seen corresponding path program 1 times [2023-11-06 23:08:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032075605] [2023-11-06 23:08:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032075605] [2023-11-06 23:08:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032075605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753301298] [2023-11-06 23:08:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:15,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:15,186 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:15,667 INFO L93 Difference]: Finished difference Result 531 states and 792 transitions. [2023-11-06 23:08:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-06 23:08:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:15,672 INFO L225 Difference]: With dead ends: 531 [2023-11-06 23:08:15,672 INFO L226 Difference]: Without dead ends: 355 [2023-11-06 23:08:15,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 23:08:15,675 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 155 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:15,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 550 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:08:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-06 23:08:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 347. [2023-11-06 23:08:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 312 states have (on average 1.4487179487179487) internal successors, (452), 312 states have internal predecessors, (452), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 23:08:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2023-11-06 23:08:15,729 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 135 [2023-11-06 23:08:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:15,730 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2023-11-06 23:08:15,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2023-11-06 23:08:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 23:08:15,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:15,735 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:08:15,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:15,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 741335402, now seen corresponding path program 1 times [2023-11-06 23:08:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190478182] [2023-11-06 23:08:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190478182] [2023-11-06 23:08:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190478182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:08:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816728263] [2023-11-06 23:08:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:08:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:08:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:18,238 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 23:08:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:19,119 INFO L93 Difference]: Finished difference Result 665 states and 988 transitions. [2023-11-06 23:08:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:08:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2023-11-06 23:08:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:19,125 INFO L225 Difference]: With dead ends: 665 [2023-11-06 23:08:19,125 INFO L226 Difference]: Without dead ends: 489 [2023-11-06 23:08:19,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:08:19,138 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 246 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:19,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1268 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:08:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-06 23:08:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 456. [2023-11-06 23:08:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 417 states have internal predecessors, (604), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 676 transitions. [2023-11-06 23:08:19,218 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 676 transitions. Word has length 136 [2023-11-06 23:08:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:19,219 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 676 transitions. [2023-11-06 23:08:19,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 23:08:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 676 transitions. [2023-11-06 23:08:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 23:08:19,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:19,223 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:19,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:08:19,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:19,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash -608558604, now seen corresponding path program 1 times [2023-11-06 23:08:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:19,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303694567] [2023-11-06 23:08:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303694567] [2023-11-06 23:08:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303694567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159415670] [2023-11-06 23:08:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:20,490 INFO L87 Difference]: Start difference. First operand 456 states and 676 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:20,898 INFO L93 Difference]: Finished difference Result 949 states and 1409 transitions. [2023-11-06 23:08:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 23:08:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:20,904 INFO L225 Difference]: With dead ends: 949 [2023-11-06 23:08:20,904 INFO L226 Difference]: Without dead ends: 496 [2023-11-06 23:08:20,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 23:08:20,906 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 200 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:20,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 567 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:08:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-06 23:08:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 456. [2023-11-06 23:08:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 416 states have (on average 1.4495192307692308) internal successors, (603), 417 states have internal predecessors, (603), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 675 transitions. [2023-11-06 23:08:20,933 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 675 transitions. Word has length 137 [2023-11-06 23:08:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:20,934 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 675 transitions. [2023-11-06 23:08:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 675 transitions. [2023-11-06 23:08:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 23:08:20,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:20,937 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:20,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:08:20,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:20,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1514344948, now seen corresponding path program 1 times [2023-11-06 23:08:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900600540] [2023-11-06 23:08:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900600540] [2023-11-06 23:08:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900600540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135736551] [2023-11-06 23:08:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:21,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:21,191 INFO L87 Difference]: Start difference. First operand 456 states and 675 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:21,278 INFO L93 Difference]: Finished difference Result 1140 states and 1693 transitions. [2023-11-06 23:08:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:08:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 23:08:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:21,284 INFO L225 Difference]: With dead ends: 1140 [2023-11-06 23:08:21,284 INFO L226 Difference]: Without dead ends: 687 [2023-11-06 23:08:21,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:21,286 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 124 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:21,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 931 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-06 23:08:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 459. [2023-11-06 23:08:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 419 states have (on average 1.4463007159904535) internal successors, (606), 420 states have internal predecessors, (606), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 678 transitions. [2023-11-06 23:08:21,322 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 678 transitions. Word has length 137 [2023-11-06 23:08:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:21,325 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 678 transitions. [2023-11-06 23:08:21,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 678 transitions. [2023-11-06 23:08:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 23:08:21,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:21,328 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:21,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:21,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:21,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -285582379, now seen corresponding path program 1 times [2023-11-06 23:08:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189534165] [2023-11-06 23:08:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189534165] [2023-11-06 23:08:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189534165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:21,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698253203] [2023-11-06 23:08:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:21,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:21,647 INFO L87 Difference]: Start difference. First operand 459 states and 678 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:21,711 INFO L93 Difference]: Finished difference Result 990 states and 1467 transitions. [2023-11-06 23:08:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-06 23:08:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:21,718 INFO L225 Difference]: With dead ends: 990 [2023-11-06 23:08:21,719 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 23:08:21,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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 23:08:21,721 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 144 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:21,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 796 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 23:08:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 468. [2023-11-06 23:08:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 428 states have (on average 1.4369158878504673) internal successors, (615), 429 states have internal predecessors, (615), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 687 transitions. [2023-11-06 23:08:21,760 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 687 transitions. Word has length 138 [2023-11-06 23:08:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:21,764 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 687 transitions. [2023-11-06 23:08:21,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 687 transitions. [2023-11-06 23:08:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 23:08:21,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:21,768 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:21,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:21,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:21,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash 903635364, now seen corresponding path program 1 times [2023-11-06 23:08:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:21,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174846897] [2023-11-06 23:08:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174846897] [2023-11-06 23:08:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174846897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840464834] [2023-11-06 23:08:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:22,541 INFO L87 Difference]: Start difference. First operand 468 states and 687 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:23,431 INFO L93 Difference]: Finished difference Result 1004 states and 1479 transitions. [2023-11-06 23:08:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-06 23:08:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:23,438 INFO L225 Difference]: With dead ends: 1004 [2023-11-06 23:08:23,438 INFO L226 Difference]: Without dead ends: 711 [2023-11-06 23:08:23,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:08:23,440 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 480 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:23,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 593 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:08:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-06 23:08:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 635. [2023-11-06 23:08:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 578 states have (on average 1.4359861591695502) internal successors, (830), 579 states have internal predecessors, (830), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-06 23:08:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 934 transitions. [2023-11-06 23:08:23,484 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 934 transitions. Word has length 138 [2023-11-06 23:08:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:23,485 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 934 transitions. [2023-11-06 23:08:23,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 934 transitions. [2023-11-06 23:08:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 23:08:23,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:23,488 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:23,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:08:23,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:23,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1188514192, now seen corresponding path program 1 times [2023-11-06 23:08:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26685053] [2023-11-06 23:08:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26685053] [2023-11-06 23:08:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26685053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361159302] [2023-11-06 23:08:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:24,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:24,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:24,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:24,232 INFO L87 Difference]: Start difference. First operand 635 states and 934 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:24,918 INFO L93 Difference]: Finished difference Result 1345 states and 1980 transitions. [2023-11-06 23:08:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-06 23:08:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:24,925 INFO L225 Difference]: With dead ends: 1345 [2023-11-06 23:08:24,925 INFO L226 Difference]: Without dead ends: 827 [2023-11-06 23:08:24,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:24,927 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 480 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:24,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 467 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:08:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2023-11-06 23:08:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 749. [2023-11-06 23:08:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 674 states have (on average 1.4198813056379822) internal successors, (957), 675 states have internal predecessors, (957), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 23:08:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1093 transitions. [2023-11-06 23:08:24,980 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1093 transitions. Word has length 138 [2023-11-06 23:08:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:24,980 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1093 transitions. [2023-11-06 23:08:24,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1093 transitions. [2023-11-06 23:08:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 23:08:24,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:24,983 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:24,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:08:24,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:24,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash 735618990, now seen corresponding path program 1 times [2023-11-06 23:08:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170147814] [2023-11-06 23:08:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170147814] [2023-11-06 23:08:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170147814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:08:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236986054] [2023-11-06 23:08:27,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:27,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:08:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:08:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:08:27,050 INFO L87 Difference]: Start difference. First operand 749 states and 1093 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:28,554 INFO L93 Difference]: Finished difference Result 1949 states and 2838 transitions. [2023-11-06 23:08:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:08:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-06 23:08:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:28,562 INFO L225 Difference]: With dead ends: 1949 [2023-11-06 23:08:28,563 INFO L226 Difference]: Without dead ends: 1203 [2023-11-06 23:08:28,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:08:28,566 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 442 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:28,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1799 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 23:08:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2023-11-06 23:08:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 982. [2023-11-06 23:08:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 897 states have (on average 1.4202898550724639) internal successors, (1274), 900 states have internal predecessors, (1274), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-06 23:08:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1426 transitions. [2023-11-06 23:08:28,635 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1426 transitions. Word has length 139 [2023-11-06 23:08:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:28,636 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1426 transitions. [2023-11-06 23:08:28,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1426 transitions. [2023-11-06 23:08:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 23:08:28,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:28,639 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:28,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:08:28,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:28,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1436683568, now seen corresponding path program 1 times [2023-11-06 23:08:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307733718] [2023-11-06 23:08:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307733718] [2023-11-06 23:08:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307733718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120509006] [2023-11-06 23:08:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:29,414 INFO L87 Difference]: Start difference. First operand 982 states and 1426 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:30,013 INFO L93 Difference]: Finished difference Result 2153 states and 3119 transitions. [2023-11-06 23:08:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-06 23:08:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:30,022 INFO L225 Difference]: With dead ends: 2153 [2023-11-06 23:08:30,022 INFO L226 Difference]: Without dead ends: 1174 [2023-11-06 23:08:30,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:30,025 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 170 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:30,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 676 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:08:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-11-06 23:08:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1103. [2023-11-06 23:08:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 994 states have (on average 1.408450704225352) internal successors, (1400), 999 states have internal predecessors, (1400), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-06 23:08:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1592 transitions. [2023-11-06 23:08:30,112 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1592 transitions. Word has length 139 [2023-11-06 23:08:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:30,112 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1592 transitions. [2023-11-06 23:08:30,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1592 transitions. [2023-11-06 23:08:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 23:08:30,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:30,116 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:08:30,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:30,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -82029460, now seen corresponding path program 1 times [2023-11-06 23:08:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799196416] [2023-11-06 23:08:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799196416] [2023-11-06 23:08:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799196416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:30,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842354850] [2023-11-06 23:08:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:30,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:30,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:30,924 INFO L87 Difference]: Start difference. First operand 1103 states and 1592 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:31,565 INFO L93 Difference]: Finished difference Result 2289 states and 3297 transitions. [2023-11-06 23:08:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2023-11-06 23:08:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:31,574 INFO L225 Difference]: With dead ends: 2289 [2023-11-06 23:08:31,574 INFO L226 Difference]: Without dead ends: 1198 [2023-11-06 23:08:31,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:31,579 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 222 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:31,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 955 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:08:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-11-06 23:08:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1102. [2023-11-06 23:08:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 995 states have (on average 1.406030150753769) internal successors, (1399), 999 states have internal predecessors, (1399), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2023-11-06 23:08:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1583 transitions. [2023-11-06 23:08:31,671 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1583 transitions. Word has length 139 [2023-11-06 23:08:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:31,671 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1583 transitions. [2023-11-06 23:08:31,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1583 transitions. [2023-11-06 23:08:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 23:08:31,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:31,675 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:31,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:08:31,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:31,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 619035118, now seen corresponding path program 1 times [2023-11-06 23:08:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088176297] [2023-11-06 23:08:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088176297] [2023-11-06 23:08:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088176297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:33,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:33,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:08:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947724552] [2023-11-06 23:08:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:33,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:08:33,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:08:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:08:33,497 INFO L87 Difference]: Start difference. First operand 1102 states and 1583 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:34,896 INFO L93 Difference]: Finished difference Result 2295 states and 3291 transitions. [2023-11-06 23:08:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 23:08:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-06 23:08:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:34,907 INFO L225 Difference]: With dead ends: 2295 [2023-11-06 23:08:34,907 INFO L226 Difference]: Without dead ends: 1196 [2023-11-06 23:08:34,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:08:34,911 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 370 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:34,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1865 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 23:08:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-11-06 23:08:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 912. [2023-11-06 23:08:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 823 states have (on average 1.4094775212636694) internal successors, (1160), 825 states have internal predecessors, (1160), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-06 23:08:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1312 transitions. [2023-11-06 23:08:34,985 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1312 transitions. Word has length 139 [2023-11-06 23:08:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:34,986 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1312 transitions. [2023-11-06 23:08:34,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1312 transitions. [2023-11-06 23:08:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 23:08:34,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:34,989 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:34,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:08:34,990 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:34,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1014010927, now seen corresponding path program 1 times [2023-11-06 23:08:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108548768] [2023-11-06 23:08:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:35,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:35,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108548768] [2023-11-06 23:08:35,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108548768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:35,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:35,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074405717] [2023-11-06 23:08:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:35,098 INFO L87 Difference]: Start difference. First operand 912 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:35,161 INFO L93 Difference]: Finished difference Result 1734 states and 2489 transitions. [2023-11-06 23:08:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:35,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-06 23:08:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:35,166 INFO L225 Difference]: With dead ends: 1734 [2023-11-06 23:08:35,167 INFO L226 Difference]: Without dead ends: 784 [2023-11-06 23:08:35,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:35,170 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:35,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2023-11-06 23:08:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 641. [2023-11-06 23:08:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 580 states have (on average 1.389655172413793) internal successors, (806), 581 states have internal predecessors, (806), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-06 23:08:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 910 transitions. [2023-11-06 23:08:35,218 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 910 transitions. Word has length 139 [2023-11-06 23:08:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:35,218 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 910 transitions. [2023-11-06 23:08:35,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 910 transitions. [2023-11-06 23:08:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 23:08:35,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:35,221 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:35,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:08:35,222 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:35,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1227230246, now seen corresponding path program 1 times [2023-11-06 23:08:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599987636] [2023-11-06 23:08:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599987636] [2023-11-06 23:08:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599987636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:37,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 23:08:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374020217] [2023-11-06 23:08:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:37,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 23:08:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 23:08:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:08:37,092 INFO L87 Difference]: Start difference. First operand 641 states and 910 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:38,782 INFO L93 Difference]: Finished difference Result 1451 states and 2072 transitions. [2023-11-06 23:08:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 23:08:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2023-11-06 23:08:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:38,790 INFO L225 Difference]: With dead ends: 1451 [2023-11-06 23:08:38,790 INFO L226 Difference]: Without dead ends: 1049 [2023-11-06 23:08:38,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2023-11-06 23:08:38,794 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 701 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:38,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1395 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 23:08:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2023-11-06 23:08:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 908. [2023-11-06 23:08:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 840 states have (on average 1.4) internal successors, (1176), 843 states have internal predecessors, (1176), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 23:08:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1288 transitions. [2023-11-06 23:08:38,868 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1288 transitions. Word has length 140 [2023-11-06 23:08:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:38,868 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1288 transitions. [2023-11-06 23:08:38,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1288 transitions. [2023-11-06 23:08:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 23:08:38,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:38,873 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:38,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:08:38,873 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:38,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -392576892, now seen corresponding path program 1 times [2023-11-06 23:08:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134620886] [2023-11-06 23:08:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134620886] [2023-11-06 23:08:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134620886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:40,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800113800] [2023-11-06 23:08:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:40,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:40,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:40,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:40,237 INFO L87 Difference]: Start difference. First operand 908 states and 1288 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:40,824 INFO L93 Difference]: Finished difference Result 1900 states and 2711 transitions. [2023-11-06 23:08:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2023-11-06 23:08:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:40,833 INFO L225 Difference]: With dead ends: 1900 [2023-11-06 23:08:40,833 INFO L226 Difference]: Without dead ends: 1235 [2023-11-06 23:08:40,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:40,835 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 195 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:40,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 664 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:08:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-06 23:08:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1075. [2023-11-06 23:08:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1007 states have (on average 1.4051638530287984) internal successors, (1415), 1010 states have internal predecessors, (1415), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 23:08:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1527 transitions. [2023-11-06 23:08:40,904 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1527 transitions. Word has length 140 [2023-11-06 23:08:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 1527 transitions. [2023-11-06 23:08:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:08:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1527 transitions. [2023-11-06 23:08:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-06 23:08:40,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:40,909 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:40,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:08:40,909 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:40,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 921922377, now seen corresponding path program 1 times [2023-11-06 23:08:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864735608] [2023-11-06 23:08:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-06 23:08:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864735608] [2023-11-06 23:08:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864735608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745846602] [2023-11-06 23:08:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:41,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:42,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:08:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 23:08:42,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:42,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 23:08:42,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:42,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:42,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:42,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:42,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:42,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:43,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:43,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 23:08:43,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 49 [2023-11-06 23:08:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-11-06 23:08:43,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:43,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-06 23:08:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-06 23:08:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745846602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:43,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2023-11-06 23:08:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141757011] [2023-11-06 23:08:43,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:43,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 23:08:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:43,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 23:08:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:08:43,848 INFO L87 Difference]: Start difference. First operand 1075 states and 1527 transitions. Second operand has 21 states, 18 states have (on average 8.277777777777779) internal successors, (149), 21 states have internal predecessors, (149), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) [2023-11-06 23:08:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:45,740 INFO L93 Difference]: Finished difference Result 2453 states and 3462 transitions. [2023-11-06 23:08:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:08:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.277777777777779) internal successors, (149), 21 states have internal predecessors, (149), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) Word has length 142 [2023-11-06 23:08:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:45,749 INFO L225 Difference]: With dead ends: 2453 [2023-11-06 23:08:45,750 INFO L226 Difference]: Without dead ends: 1394 [2023-11-06 23:08:45,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2023-11-06 23:08:45,753 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 1439 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:45,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 1027 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:08:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-11-06 23:08:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 875. [2023-11-06 23:08:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 815 states have (on average 1.396319018404908) internal successors, (1138), 815 states have internal predecessors, (1138), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 23:08:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1234 transitions. [2023-11-06 23:08:45,814 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1234 transitions. Word has length 142 [2023-11-06 23:08:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:45,814 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1234 transitions. [2023-11-06 23:08:45,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.277777777777779) internal successors, (149), 21 states have internal predecessors, (149), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) [2023-11-06 23:08:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1234 transitions. [2023-11-06 23:08:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-06 23:08:45,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:45,817 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:45,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:46,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 23:08:46,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:46,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2106000864, now seen corresponding path program 1 times [2023-11-06 23:08:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248953677] [2023-11-06 23:08:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248953677] [2023-11-06 23:08:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248953677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311010752] [2023-11-06 23:08:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:46,289 INFO L87 Difference]: Start difference. First operand 875 states and 1234 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:46,734 INFO L93 Difference]: Finished difference Result 2282 states and 3216 transitions. [2023-11-06 23:08:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2023-11-06 23:08:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:46,743 INFO L225 Difference]: With dead ends: 2282 [2023-11-06 23:08:46,743 INFO L226 Difference]: Without dead ends: 1410 [2023-11-06 23:08:46,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:46,745 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 187 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:46,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 488 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:08:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-11-06 23:08:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 881. [2023-11-06 23:08:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 821 states have (on average 1.3934226552984166) internal successors, (1144), 821 states have internal predecessors, (1144), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 23:08:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1240 transitions. [2023-11-06 23:08:46,799 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1240 transitions. Word has length 142 [2023-11-06 23:08:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:46,799 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1240 transitions. [2023-11-06 23:08:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1240 transitions. [2023-11-06 23:08:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-06 23:08:46,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:46,802 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:46,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:08:46,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:46,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2054952926, now seen corresponding path program 1 times [2023-11-06 23:08:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307412414] [2023-11-06 23:08:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:47,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307412414] [2023-11-06 23:08:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307412414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326614875] [2023-11-06 23:08:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:47,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:47,816 INFO L87 Difference]: Start difference. First operand 881 states and 1240 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:48,449 INFO L93 Difference]: Finished difference Result 1993 states and 2796 transitions. [2023-11-06 23:08:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:08:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2023-11-06 23:08:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:48,456 INFO L225 Difference]: With dead ends: 1993 [2023-11-06 23:08:48,456 INFO L226 Difference]: Without dead ends: 1115 [2023-11-06 23:08:48,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:08:48,459 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 239 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:48,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 728 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:08:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-11-06 23:08:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 943. [2023-11-06 23:08:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 872 states have (on average 1.3876146788990826) internal successors, (1210), 873 states have internal predecessors, (1210), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 23:08:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1322 transitions. [2023-11-06 23:08:48,529 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1322 transitions. Word has length 142 [2023-11-06 23:08:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:48,529 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1322 transitions. [2023-11-06 23:08:48,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1322 transitions. [2023-11-06 23:08:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 23:08:48,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:48,534 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:08:48,534 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:48,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1938950114, now seen corresponding path program 1 times [2023-11-06 23:08:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623079158] [2023-11-06 23:08:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:08:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:08:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:08:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:08:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 23:08:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:08:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:08:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:08:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:08:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:08:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623079158] [2023-11-06 23:08:49,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623079158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:49,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459529758] [2023-11-06 23:08:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:49,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:49,551 INFO L87 Difference]: Start difference. First operand 943 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:49,935 INFO L93 Difference]: Finished difference Result 1963 states and 2746 transitions. [2023-11-06 23:08:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2023-11-06 23:08:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:49,941 INFO L225 Difference]: With dead ends: 1963 [2023-11-06 23:08:49,941 INFO L226 Difference]: Without dead ends: 1023 [2023-11-06 23:08:49,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:49,944 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 133 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:49,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 510 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:08:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2023-11-06 23:08:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 935. [2023-11-06 23:08:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 864 states have (on average 1.3831018518518519) internal successors, (1195), 865 states have internal predecessors, (1195), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 23:08:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1307 transitions. [2023-11-06 23:08:50,009 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1307 transitions. Word has length 143 [2023-11-06 23:08:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:50,009 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1307 transitions. [2023-11-06 23:08:50,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:08:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1307 transitions. [2023-11-06 23:08:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 23:08:50,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:50,013 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:50,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:08:50,013 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:50,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1104296760, now seen corresponding path program 1 times [2023-11-06 23:08:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246077703] [2023-11-06 23:08:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:50,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:08:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:50,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:08:50,214 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:08:50,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:08:50,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:08:50,222 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:50,226 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:08:50,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:08:50 BoogieIcfgContainer [2023-11-06 23:08:50,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:08:50,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:08:50,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:08:50,328 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:08:50,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:11" (3/4) ... [2023-11-06 23:08:50,330 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:08:50,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:08:50,332 INFO L158 Benchmark]: Toolchain (without parser) took 40160.12ms. Allocated memory was 153.1MB in the beginning and 775.9MB in the end (delta: 622.9MB). Free memory was 105.9MB in the beginning and 473.4MB in the end (delta: -367.5MB). Peak memory consumption was 255.6MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,333 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 153.1MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:50,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.94ms. Allocated memory is still 153.1MB. Free memory was 105.7MB in the beginning and 88.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.39ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,338 INFO L158 Benchmark]: Boogie Preprocessor took 105.09ms. Allocated memory is still 153.1MB. Free memory was 84.6MB in the beginning and 80.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,342 INFO L158 Benchmark]: RCFGBuilder took 992.99ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 80.6MB in the beginning and 149.9MB in the end (delta: -69.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,342 INFO L158 Benchmark]: TraceAbstraction took 38569.56ms. Allocated memory was 203.4MB in the beginning and 775.9MB in the end (delta: 572.5MB). Free memory was 148.9MB in the beginning and 473.4MB in the end (delta: -324.5MB). Peak memory consumption was 246.9MB. Max. memory is 16.1GB. [2023-11-06 23:08:50,342 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 775.9MB. Free memory is still 473.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:50,345 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.25ms. Allocated memory is still 153.1MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.94ms. Allocated memory is still 153.1MB. Free memory was 105.7MB in the beginning and 88.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.39ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.09ms. Allocated memory is still 153.1MB. Free memory was 84.6MB in the beginning and 80.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 992.99ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 80.6MB in the beginning and 149.9MB in the end (delta: -69.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38569.56ms. Allocated memory was 203.4MB in the beginning and 775.9MB in the end (delta: 572.5MB). Free memory was 148.9MB in the beginning and 473.4MB in the end (delta: -324.5MB). Peak memory consumption was 246.9MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 775.9MB. Free memory is still 473.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 someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someUnaryDOUBLEoperation at line 51. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_11 [L114] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00.var_1_4=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00.var_1_4=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00.var_1_5=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-1073741823, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00.var_1_7=-1073741823, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-1073741823, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00.var_1_7=-1073741823, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=-1073741822, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00.var_1_8=-1073741822, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=-1073741822, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00.var_1_8=-1073741822, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=536870911, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00.var_1_10=536870911, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=536870911, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00.var_1_10=536870911, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00.var_1_13=536870927, WrapperStruct00.var_1_13=536870927, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=536870927, WrapperStruct00.var_1_13=536870927, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=536870927, WrapperStruct00.var_1_13=536870927, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00.var_1_14=536870919, WrapperStruct00.var_1_14=536870919, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )=1, WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F=1, WrapperStruct00.var_1_14=536870919, WrapperStruct00.var_1_14=536870919, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )=1, WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F=1, WrapperStruct00.var_1_14=536870919, WrapperStruct00.var_1_14=536870919, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00.var_1_15=536870925, WrapperStruct00.var_1_15=536870925, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )=1, WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F=1, WrapperStruct00.var_1_15=536870925, WrapperStruct00.var_1_15=536870925, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )=1, WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F=1, WrapperStruct00.var_1_15=536870925, WrapperStruct00.var_1_15=536870925, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00.var_1_16=536870918, WrapperStruct00.var_1_16=536870918, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )=1, WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F=1, WrapperStruct00.var_1_16=536870918, WrapperStruct00.var_1_16=536870918, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )=1, WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F=1, WrapperStruct00.var_1_16=536870918, WrapperStruct00.var_1_16=536870918, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET updateVariables() [L126] CALL step() [L59] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L60] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L65] EXPR WrapperStruct00.var_1_7 [L65] signed long int stepLocal_2 = WrapperStruct00.var_1_7; [L66] EXPR WrapperStruct00.var_1_10 [L66] signed long int stepLocal_1 = WrapperStruct00.var_1_10; [L67] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=-1073741822, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L67] COND FALSE !(WrapperStruct00.var_1_8 <= stepLocal_2) [L74] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L74] COND FALSE !(! WrapperStruct00.var_1_11) [L77] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR WrapperStruct00.var_1_7 [L77] WrapperStruct00.var_1_6 = ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7) [L79] WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L79] COND FALSE !(WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_15 [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1 VAL [(! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) [L117] EXPR WrapperStruct00.var_1_11 VAL [(! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, WrapperStruct00.var_1_11=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) [L117] EXPR WrapperStruct00.var_1_6 [L117] EXPR WrapperStruct00.var_1_9 VAL [(! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [(! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 [L117] EXPR WrapperStruct00.var_1_7 [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) [L117] EXPR WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_7 VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1 VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) [L117] EXPR WrapperStruct00.var_1_4 VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)))=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_4=-256, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) [L117] EXPR WrapperStruct00.var_1_12 [L117] EXPR WrapperStruct00.var_1_15 [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)))=1, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_12=536870925, WrapperStruct00.var_1_15=536870925, WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))=0, WrapperStruct00.var_1_4=-256, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) VAL [(! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))=1, (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1=1, ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))=1, (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)))=0, ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)=1, (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1=1, WrapperStruct00.var_1_10=536870911, WrapperStruct00.var_1_11=1, WrapperStruct00.var_1_12=536870925, WrapperStruct00.var_1_15=536870925, WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))=0, WrapperStruct00.var_1_4=-256, WrapperStruct00.var_1_6=-536870911, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_7=-1073741823, WrapperStruct00.var_1_8=-1073741822, WrapperStruct00.var_1_9=-1, WrapperStruct00.var_1_9=-1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117-L118] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6219 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6211 mSDsluCounter, 16918 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12682 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11060 IncrementalHoareTripleChecker+Invalid, 11399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 4236 mSDtfsCounter, 11060 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1245 GetRequests, 1067 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=11, InterpolantAutomatonStates: 177, 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, 20 MinimizatonAttempts, 3034 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 3056 NumberOfCodeBlocks, 3056 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3033 ConstructedInterpolants, 0 QuantifiedInterpolants, 9850 SizeOfPredicates, 8 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10452/10560 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 23:08:50,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:52,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:53,109 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 23:08:53,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:53,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:53,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:53,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:53,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:53,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:53,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:53,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:53,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:53,175 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:53,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:53,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:53,178 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:53,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:53,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:53,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:53,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:53,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:53,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:08:53,181 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:08:53,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:08:53,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:53,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:53,183 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:53,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:53,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:53,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:53,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:53,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:53,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:53,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:53,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:08:53,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:08:53,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:53,188 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:53,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:53,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:53,189 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:08:53,189 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:53,190 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 -> 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 [2023-11-06 23:08:53,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:53,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:53,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:53,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:53,569 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:53,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:08:56,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:57,083 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:57,088 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:08:57,105 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/0b56e70f5/617a2d68070f408c86754e1bf33d844a/FLAG49bf43812 [2023-11-06 23:08:57,124 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/data/0b56e70f5/617a2d68070f408c86754e1bf33d844a [2023-11-06 23:08:57,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:57,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:57,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:57,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:57,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:57,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fad8f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57, skipping insertion in model container [2023-11-06 23:08:57,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:57,348 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-11-06 23:08:57,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:57,429 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:57,443 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-11-06 23:08:57,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:57,560 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:57,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57 WrapperNode [2023-11-06 23:08:57,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:57,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:57,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:57,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:57,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,671 INFO L138 Inliner]: procedures = 33, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2023-11-06 23:08:57,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:57,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:57,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:57,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:57,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:57,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:57,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:57,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:57,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (1/1) ... [2023-11-06 23:08:57,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:57,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:57,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:57,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:57,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 23:08:57,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 23:08:57,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 23:08:57,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:08:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 23:08:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 23:08:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 23:08:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:08:57,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:08:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:57,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 23:08:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:08:58,089 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:58,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:09:00,144 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:09:00,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:09:00,159 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:09:00,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:00 BoogieIcfgContainer [2023-11-06 23:09:00,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:09:00,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:09:00,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:09:00,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:09:00,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:57" (1/3) ... [2023-11-06 23:09:00,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8fbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:00, skipping insertion in model container [2023-11-06 23:09:00,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:57" (2/3) ... [2023-11-06 23:09:00,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8fbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:00, skipping insertion in model container [2023-11-06 23:09:00,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:00" (3/3) ... [2023-11-06 23:09:00,175 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-3.i [2023-11-06 23:09:00,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:09:00,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:09:00,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:09:00,271 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;@32c9af2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:09:00,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:09:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:09:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 23:09:00,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:00,302 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:09:00,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:00,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1212346061, now seen corresponding path program 1 times [2023-11-06 23:09:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:09:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880757464] [2023-11-06 23:09:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:00,325 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 23:09:00,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:09:00,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 23:09:00,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 23:09:00,613 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 23:09:00,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 23:09:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:09:00,814 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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 23:09:00,820 INFO L158 Benchmark]: Toolchain (without parser) took 3687.20ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 49.6MB in the end (delta: 30.2MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,820 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 51.2MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:09:00,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.71ms. Allocated memory is still 104.9MB. Free memory was 79.5MB in the beginning and 61.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.65ms. Allocated memory is still 104.9MB. Free memory was 61.3MB in the beginning and 57.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,822 INFO L158 Benchmark]: Boogie Preprocessor took 138.95ms. Allocated memory is still 104.9MB. Free memory was 57.2MB in the beginning and 80.9MB in the end (delta: -23.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,823 INFO L158 Benchmark]: RCFGBuilder took 2339.01ms. Allocated memory is still 104.9MB. Free memory was 80.9MB in the beginning and 74.3MB in the end (delta: 6.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,825 INFO L158 Benchmark]: TraceAbstraction took 652.85ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 49.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 23:09:00,831 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.24ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 51.2MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.71ms. Allocated memory is still 104.9MB. Free memory was 79.5MB in the beginning and 61.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.65ms. Allocated memory is still 104.9MB. Free memory was 61.3MB in the beginning and 57.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.95ms. Allocated memory is still 104.9MB. Free memory was 57.2MB in the beginning and 80.9MB in the end (delta: -23.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2339.01ms. Allocated memory is still 104.9MB. Free memory was 80.9MB in the beginning and 74.3MB in the end (delta: 6.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 652.85ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 49.6MB in the end (delta: 24.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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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 23:09:00,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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_e67e908f-f1b2-4d2c-908c-1ba30b9ab852/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.