./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:24,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:24,790 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:14:24,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:24,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:24,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:24,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:24,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:24,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:24,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:24,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:24,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:24,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:24,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:24,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:24,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:24,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:14:24,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:24,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:24,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:24,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:24,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:24,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:24,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:24,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:24,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:24,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:24,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:24,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:24,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:24,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:24,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:24,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:14:24,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:14:24,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:24,886 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:24,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:24,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:24,887 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:24,887 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_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2023-11-06 22:14:25,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:25,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:25,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:25,278 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:25,278 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:25,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:14:28,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:29,025 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:29,025 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:14:29,037 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/5abf2fb4e/0094c9b0cb874207a9d9706d261d890e/FLAGbafe6af90 [2023-11-06 22:14:29,055 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/5abf2fb4e/0094c9b0cb874207a9d9706d261d890e [2023-11-06 22:14:29,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:29,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:29,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:29,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:29,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:29,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3761befc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29, skipping insertion in model container [2023-11-06 22:14:29,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:29,321 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_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2023-11-06 22:14:29,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:29,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:29,423 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_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2023-11-06 22:14:29,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:29,498 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:29,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29 WrapperNode [2023-11-06 22:14:29,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:29,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:29,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:29,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:29,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,609 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 428 [2023-11-06 22:14:29,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:29,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:29,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:29,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:29,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:29,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:29,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:29,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:29,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (1/1) ... [2023-11-06 22:14:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:29,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:14:29,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:14:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:14:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:14:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:14:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:14:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:14:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:14:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:14:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:14:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:29,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:30,091 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:30,094 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:30,780 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:30,788 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:30,788 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:14:30,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:30 BoogieIcfgContainer [2023-11-06 22:14:30,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:30,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:30,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:30,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:30,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:29" (1/3) ... [2023-11-06 22:14:30,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7bcfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:30, skipping insertion in model container [2023-11-06 22:14:30,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:29" (2/3) ... [2023-11-06 22:14:30,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7bcfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:30, skipping insertion in model container [2023-11-06 22:14:30,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:30" (3/3) ... [2023-11-06 22:14:30,802 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:14:30,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:30,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:14:30,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:30,887 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;@16d1c19c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:30,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:14:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:30,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:30,910 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:30,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:30,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -261452828, now seen corresponding path program 1 times [2023-11-06 22:14:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118327173] [2023-11-06 22:14:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118327173] [2023-11-06 22:14:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118327173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:14:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593640764] [2023-11-06 22:14:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:31,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:31,581 INFO L87 Difference]: Start difference. First operand has 101 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:14:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:31,621 INFO L93 Difference]: Finished difference Result 195 states and 307 transitions. [2023-11-06 22:14:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2023-11-06 22:14:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:31,634 INFO L225 Difference]: With dead ends: 195 [2023-11-06 22:14:31,634 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:14:31,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:31,643 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:31,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:14:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:14:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-06 22:14:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2023-11-06 22:14:31,698 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 98 [2023-11-06 22:14:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:31,699 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2023-11-06 22:14:31,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:14:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2023-11-06 22:14:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:31,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:31,705 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:31,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:14:31,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:31,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1943487078, now seen corresponding path program 1 times [2023-11-06 22:14:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294925272] [2023-11-06 22:14:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294925272] [2023-11-06 22:14:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294925272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718325993] [2023-11-06 22:14:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:32,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:14:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:14:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:32,253 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:32,386 INFO L93 Difference]: Finished difference Result 199 states and 298 transitions. [2023-11-06 22:14:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:14:32,388 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-11-06 22:14:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:32,391 INFO L225 Difference]: With dead ends: 199 [2023-11-06 22:14:32,393 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:14:32,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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 22:14:32,398 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 12 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 419 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:32,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 419 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:14:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:14:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2023-11-06 22:14:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2023-11-06 22:14:32,427 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 98 [2023-11-06 22:14:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:32,435 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2023-11-06 22:14:32,436 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2023-11-06 22:14:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:32,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:32,451 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:32,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:14:32,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:32,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash -576472856, now seen corresponding path program 1 times [2023-11-06 22:14:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696559838] [2023-11-06 22:14:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696559838] [2023-11-06 22:14:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696559838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077523791] [2023-11-06 22:14:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:33,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:33,028 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:33,424 INFO L93 Difference]: Finished difference Result 318 states and 476 transitions. [2023-11-06 22:14:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:14:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-11-06 22:14:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:33,429 INFO L225 Difference]: With dead ends: 318 [2023-11-06 22:14:33,429 INFO L226 Difference]: Without dead ends: 222 [2023-11-06 22:14:33,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:14:33,432 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 169 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:33,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 624 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-06 22:14:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2023-11-06 22:14:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.4903846153846154) internal successors, (155), 104 states have internal predecessors, (155), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2023-11-06 22:14:33,453 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 98 [2023-11-06 22:14:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:33,453 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2023-11-06 22:14:33,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2023-11-06 22:14:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:33,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:33,456 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:33,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:14:33,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:33,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1856336534, now seen corresponding path program 1 times [2023-11-06 22:14:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829755436] [2023-11-06 22:14:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829755436] [2023-11-06 22:14:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829755436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:34,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205097256] [2023-11-06 22:14:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:34,068 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:34,444 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2023-11-06 22:14:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:14:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-11-06 22:14:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:34,447 INFO L225 Difference]: With dead ends: 280 [2023-11-06 22:14:34,448 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 22:14:34,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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 22:14:34,451 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 157 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:34,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 453 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 22:14:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2023-11-06 22:14:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 106 states have internal predecessors, (157), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2023-11-06 22:14:34,468 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 98 [2023-11-06 22:14:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:34,469 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2023-11-06 22:14:34,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2023-11-06 22:14:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:34,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:34,472 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:34,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:14:34,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:34,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1913056106, now seen corresponding path program 1 times [2023-11-06 22:14:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311311373] [2023-11-06 22:14:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:35,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311311373] [2023-11-06 22:14:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311311373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:35,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128137584] [2023-11-06 22:14:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:35,044 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:35,443 INFO L93 Difference]: Finished difference Result 304 states and 454 transitions. [2023-11-06 22:14:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:14:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-11-06 22:14:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:35,446 INFO L225 Difference]: With dead ends: 304 [2023-11-06 22:14:35,446 INFO L226 Difference]: Without dead ends: 190 [2023-11-06 22:14:35,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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 22:14:35,449 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 240 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:35,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 446 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-06 22:14:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 119. [2023-11-06 22:14:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 108 states have internal predecessors, (159), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:14:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2023-11-06 22:14:35,463 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 98 [2023-11-06 22:14:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:35,464 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2023-11-06 22:14:35,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2023-11-06 22:14:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:35,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:35,466 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:14:35,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:35,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash 633192428, now seen corresponding path program 1 times [2023-11-06 22:14:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050045899] [2023-11-06 22:14:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:14:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050045899] [2023-11-06 22:14:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050045899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736947585] [2023-11-06 22:14:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:36,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:36,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:36,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:14:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:14:37,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:37,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:37,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 22:14:37,433 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 29 treesize of output 13 [2023-11-06 22:14:37,525 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 29 treesize of output 13 [2023-11-06 22:14:37,591 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 29 treesize of output 13 [2023-11-06 22:14:37,660 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 29 treesize of output 13 [2023-11-06 22:14:37,727 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 29 treesize of output 13 [2023-11-06 22:14:37,819 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 19 treesize of output 7 [2023-11-06 22:14:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:14:37,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:38,194 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 21 treesize of output 9 [2023-11-06 22:14:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:14:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736947585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:38,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2023-11-06 22:14:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445293238] [2023-11-06 22:14:38,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:38,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:14:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:14:38,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:14:38,256 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2023-11-06 22:14:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:39,805 INFO L93 Difference]: Finished difference Result 360 states and 533 transitions. [2023-11-06 22:14:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:14:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 98 [2023-11-06 22:14:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:39,810 INFO L225 Difference]: With dead ends: 360 [2023-11-06 22:14:39,810 INFO L226 Difference]: Without dead ends: 244 [2023-11-06 22:14:39,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:14:39,813 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 468 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:39,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1105 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:14:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-06 22:14:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 164. [2023-11-06 22:14:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4225352112676057) internal successors, (202), 142 states have internal predecessors, (202), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:14:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2023-11-06 22:14:39,854 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 98 [2023-11-06 22:14:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:39,855 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2023-11-06 22:14:39,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2023-11-06 22:14:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2023-11-06 22:14:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:14:39,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:39,861 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:39,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:40,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:14:40,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:40,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2019395822, now seen corresponding path program 1 times [2023-11-06 22:14:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704919875] [2023-11-06 22:14:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704919875] [2023-11-06 22:14:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704919875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:14:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254842643] [2023-11-06 22:14:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:42,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:14:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:14:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:14:42,155 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:42,951 INFO L93 Difference]: Finished difference Result 509 states and 751 transitions. [2023-11-06 22:14:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:14:42,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-11-06 22:14:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:42,956 INFO L225 Difference]: With dead ends: 509 [2023-11-06 22:14:42,956 INFO L226 Difference]: Without dead ends: 393 [2023-11-06 22:14:42,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:14:42,958 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 270 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:42,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 792 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:14:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-06 22:14:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 280. [2023-11-06 22:14:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 248 states have (on average 1.4435483870967742) internal successors, (358), 248 states have internal predecessors, (358), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 412 transitions. [2023-11-06 22:14:43,004 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 412 transitions. Word has length 98 [2023-11-06 22:14:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:43,006 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 412 transitions. [2023-11-06 22:14:43,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 412 transitions. [2023-11-06 22:14:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:14:43,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:43,010 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:43,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:14:43,011 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:43,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash -625265894, now seen corresponding path program 1 times [2023-11-06 22:14:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216769047] [2023-11-06 22:14:43,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216769047] [2023-11-06 22:14:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216769047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819062940] [2023-11-06 22:14:43,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:43,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:43,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:43,252 INFO L87 Difference]: Start difference. First operand 280 states and 412 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:43,636 INFO L93 Difference]: Finished difference Result 752 states and 1110 transitions. [2023-11-06 22:14:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:14:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-11-06 22:14:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:43,641 INFO L225 Difference]: With dead ends: 752 [2023-11-06 22:14:43,641 INFO L226 Difference]: Without dead ends: 520 [2023-11-06 22:14:43,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 22:14:43,644 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 196 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:43,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 509 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-11-06 22:14:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 304. [2023-11-06 22:14:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 272 states have (on average 1.4485294117647058) internal successors, (394), 272 states have internal predecessors, (394), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 448 transitions. [2023-11-06 22:14:43,681 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 448 transitions. Word has length 99 [2023-11-06 22:14:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:43,681 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 448 transitions. [2023-11-06 22:14:43,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 448 transitions. [2023-11-06 22:14:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 22:14:43,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:43,683 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:43,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:14:43,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:43,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1017987287, now seen corresponding path program 1 times [2023-11-06 22:14:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:43,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864551872] [2023-11-06 22:14:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:43,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864551872] [2023-11-06 22:14:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864551872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340975563] [2023-11-06 22:14:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:44,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:44,913 INFO L87 Difference]: Start difference. First operand 304 states and 448 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:45,233 INFO L93 Difference]: Finished difference Result 718 states and 1072 transitions. [2023-11-06 22:14:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-11-06 22:14:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:45,238 INFO L225 Difference]: With dead ends: 718 [2023-11-06 22:14:45,238 INFO L226 Difference]: Without dead ends: 462 [2023-11-06 22:14:45,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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 22:14:45,240 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 165 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:45,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 422 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-11-06 22:14:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 362. [2023-11-06 22:14:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 330 states have (on average 1.4666666666666666) internal successors, (484), 330 states have internal predecessors, (484), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 538 transitions. [2023-11-06 22:14:45,278 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 538 transitions. Word has length 100 [2023-11-06 22:14:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:45,280 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 538 transitions. [2023-11-06 22:14:45,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 538 transitions. [2023-11-06 22:14:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 22:14:45,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:45,283 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:45,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:14:45,283 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:45,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2029104537, now seen corresponding path program 1 times [2023-11-06 22:14:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842934053] [2023-11-06 22:14:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842934053] [2023-11-06 22:14:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842934053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:45,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:45,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953768768] [2023-11-06 22:14:45,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:45,521 INFO L87 Difference]: Start difference. First operand 362 states and 538 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:45,592 INFO L93 Difference]: Finished difference Result 723 states and 1083 transitions. [2023-11-06 22:14:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-11-06 22:14:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:45,596 INFO L225 Difference]: With dead ends: 723 [2023-11-06 22:14:45,596 INFO L226 Difference]: Without dead ends: 409 [2023-11-06 22:14:45,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 22:14:45,598 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 92 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 569 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:14:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-06 22:14:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 367. [2023-11-06 22:14:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 335 states have (on average 1.4597014925373135) internal successors, (489), 335 states have internal predecessors, (489), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 543 transitions. [2023-11-06 22:14:45,633 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 543 transitions. Word has length 100 [2023-11-06 22:14:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:45,633 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 543 transitions. [2023-11-06 22:14:45,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 543 transitions. [2023-11-06 22:14:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 22:14:45,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:45,637 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:45,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:14:45,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:45,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1836766067, now seen corresponding path program 1 times [2023-11-06 22:14:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029857245] [2023-11-06 22:14:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:45,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029857245] [2023-11-06 22:14:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029857245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:45,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843175320] [2023-11-06 22:14:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:45,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:45,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:45,892 INFO L87 Difference]: Start difference. First operand 367 states and 543 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:46,286 INFO L93 Difference]: Finished difference Result 851 states and 1256 transitions. [2023-11-06 22:14:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-11-06 22:14:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:46,293 INFO L225 Difference]: With dead ends: 851 [2023-11-06 22:14:46,294 INFO L226 Difference]: Without dead ends: 532 [2023-11-06 22:14:46,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 22:14:46,296 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 171 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:46,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 402 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-11-06 22:14:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 367. [2023-11-06 22:14:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 335 states have (on average 1.4417910447761193) internal successors, (483), 335 states have internal predecessors, (483), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 537 transitions. [2023-11-06 22:14:46,338 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 537 transitions. Word has length 100 [2023-11-06 22:14:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:46,339 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 537 transitions. [2023-11-06 22:14:46,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 537 transitions. [2023-11-06 22:14:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:14:46,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:46,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:14:46,342 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:46,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1023282615, now seen corresponding path program 1 times [2023-11-06 22:14:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:46,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889910025] [2023-11-06 22:14:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889910025] [2023-11-06 22:14:47,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889910025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:47,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:47,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:14:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937713014] [2023-11-06 22:14:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:47,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:14:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:47,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:14:47,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:14:47,391 INFO L87 Difference]: Start difference. First operand 367 states and 537 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:48,443 INFO L93 Difference]: Finished difference Result 851 states and 1239 transitions. [2023-11-06 22:14:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:14:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2023-11-06 22:14:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:48,449 INFO L225 Difference]: With dead ends: 851 [2023-11-06 22:14:48,449 INFO L226 Difference]: Without dead ends: 522 [2023-11-06 22:14:48,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:14:48,451 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 503 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:48,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 721 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:14:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-06 22:14:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 367. [2023-11-06 22:14:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 335 states have (on average 1.4268656716417911) internal successors, (478), 335 states have internal predecessors, (478), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 532 transitions. [2023-11-06 22:14:48,488 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 532 transitions. Word has length 101 [2023-11-06 22:14:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:48,489 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 532 transitions. [2023-11-06 22:14:48,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 532 transitions. [2023-11-06 22:14:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:14:48,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:48,492 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:48,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:14:48,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:48,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash 59125380, now seen corresponding path program 1 times [2023-11-06 22:14:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:48,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878520632] [2023-11-06 22:14:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878520632] [2023-11-06 22:14:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878520632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:49,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339525482] [2023-11-06 22:14:49,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:49,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:49,549 INFO L87 Difference]: Start difference. First operand 367 states and 532 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:49,919 INFO L93 Difference]: Finished difference Result 688 states and 1001 transitions. [2023-11-06 22:14:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:14:49,920 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2023-11-06 22:14:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:49,923 INFO L225 Difference]: With dead ends: 688 [2023-11-06 22:14:49,923 INFO L226 Difference]: Without dead ends: 369 [2023-11-06 22:14:49,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:14:49,925 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 133 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:49,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 349 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-11-06 22:14:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2023-11-06 22:14:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 335 states have (on average 1.4208955223880597) internal successors, (476), 335 states have internal predecessors, (476), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 530 transitions. [2023-11-06 22:14:49,964 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 530 transitions. Word has length 102 [2023-11-06 22:14:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:49,964 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 530 transitions. [2023-11-06 22:14:49,965 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 530 transitions. [2023-11-06 22:14:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:14:49,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:49,967 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:49,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:14:49,967 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:49,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash -72389941, now seen corresponding path program 1 times [2023-11-06 22:14:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819409552] [2023-11-06 22:14:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819409552] [2023-11-06 22:14:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819409552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:14:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618906611] [2023-11-06 22:14:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:14:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:14:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:50,880 INFO L87 Difference]: Start difference. First operand 367 states and 530 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:52,261 INFO L93 Difference]: Finished difference Result 1188 states and 1719 transitions. [2023-11-06 22:14:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:14:52,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2023-11-06 22:14:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:52,269 INFO L225 Difference]: With dead ends: 1188 [2023-11-06 22:14:52,269 INFO L226 Difference]: Without dead ends: 869 [2023-11-06 22:14:52,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:14:52,271 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 481 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:52,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 882 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:14:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2023-11-06 22:14:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 398. [2023-11-06 22:14:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 366 states have (on average 1.4262295081967213) internal successors, (522), 366 states have internal predecessors, (522), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 576 transitions. [2023-11-06 22:14:52,323 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 576 transitions. Word has length 103 [2023-11-06 22:14:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 576 transitions. [2023-11-06 22:14:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 576 transitions. [2023-11-06 22:14:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:14:52,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:52,327 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:14:52,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:52,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1660737843, now seen corresponding path program 1 times [2023-11-06 22:14:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428012822] [2023-11-06 22:14:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:52,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428012822] [2023-11-06 22:14:52,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428012822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:14:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769125408] [2023-11-06 22:14:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:52,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:14:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:14:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:14:52,849 INFO L87 Difference]: Start difference. First operand 398 states and 576 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:53,334 INFO L93 Difference]: Finished difference Result 672 states and 975 transitions. [2023-11-06 22:14:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:14:53,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2023-11-06 22:14:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:53,338 INFO L225 Difference]: With dead ends: 672 [2023-11-06 22:14:53,338 INFO L226 Difference]: Without dead ends: 322 [2023-11-06 22:14:53,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:14:53,340 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 147 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:53,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 577 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:14:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-06 22:14:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2023-11-06 22:14:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 281 states have (on average 1.405693950177936) internal successors, (395), 281 states have internal predecessors, (395), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 449 transitions. [2023-11-06 22:14:53,373 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 449 transitions. Word has length 103 [2023-11-06 22:14:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:53,374 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 449 transitions. [2023-11-06 22:14:53,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 449 transitions. [2023-11-06 22:14:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:14:53,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:53,377 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:14:53,377 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:53,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash -318834551, now seen corresponding path program 1 times [2023-11-06 22:14:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48735455] [2023-11-06 22:14:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48735455] [2023-11-06 22:14:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48735455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:14:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550365726] [2023-11-06 22:14:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:14:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:14:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:14:53,998 INFO L87 Difference]: Start difference. First operand 313 states and 449 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:55,451 INFO L93 Difference]: Finished difference Result 1006 states and 1468 transitions. [2023-11-06 22:14:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:14:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2023-11-06 22:14:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:55,459 INFO L225 Difference]: With dead ends: 1006 [2023-11-06 22:14:55,459 INFO L226 Difference]: Without dead ends: 741 [2023-11-06 22:14:55,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:14:55,461 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 394 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:55,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1419 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:14:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-06 22:14:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 373. [2023-11-06 22:14:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 341 states have (on average 1.434017595307918) internal successors, (489), 341 states have internal predecessors, (489), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:14:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 543 transitions. [2023-11-06 22:14:55,505 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 543 transitions. Word has length 103 [2023-11-06 22:14:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:55,506 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 543 transitions. [2023-11-06 22:14:55,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 543 transitions. [2023-11-06 22:14:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:14:55,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:55,508 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:55,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:14:55,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:55,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -99979833, now seen corresponding path program 1 times [2023-11-06 22:14:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377134295] [2023-11-06 22:14:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377134295] [2023-11-06 22:14:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377134295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:14:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30982279] [2023-11-06 22:14:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:56,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:14:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:56,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:14:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:56,989 INFO L87 Difference]: Start difference. First operand 373 states and 543 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:58,557 INFO L93 Difference]: Finished difference Result 924 states and 1338 transitions. [2023-11-06 22:14:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:14:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2023-11-06 22:14:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:58,562 INFO L225 Difference]: With dead ends: 924 [2023-11-06 22:14:58,562 INFO L226 Difference]: Without dead ends: 599 [2023-11-06 22:14:58,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:14:58,564 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 655 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:58,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 921 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:14:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2023-11-06 22:14:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 477. [2023-11-06 22:14:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 435 states have (on average 1.4206896551724137) internal successors, (618), 435 states have internal predecessors, (618), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:14:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 690 transitions. [2023-11-06 22:14:58,615 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 690 transitions. Word has length 103 [2023-11-06 22:14:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:58,616 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 690 transitions. [2023-11-06 22:14:58,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 690 transitions. [2023-11-06 22:14:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:14:58,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:58,619 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:58,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:14:58,619 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:58,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -777836242, now seen corresponding path program 1 times [2023-11-06 22:14:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782625331] [2023-11-06 22:14:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782625331] [2023-11-06 22:14:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782625331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:14:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383539298] [2023-11-06 22:14:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:58,798 INFO L87 Difference]: Start difference. First operand 477 states and 690 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:58,866 INFO L93 Difference]: Finished difference Result 942 states and 1367 transitions. [2023-11-06 22:14:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:58,867 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2023-11-06 22:14:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:58,870 INFO L225 Difference]: With dead ends: 942 [2023-11-06 22:14:58,870 INFO L226 Difference]: Without dead ends: 513 [2023-11-06 22:14:58,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 22:14:58,872 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 53 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:58,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 542 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:14:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-11-06 22:14:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 486. [2023-11-06 22:14:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 444 states have (on average 1.412162162162162) internal successors, (627), 444 states have internal predecessors, (627), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:14:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 699 transitions. [2023-11-06 22:14:58,916 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 699 transitions. Word has length 104 [2023-11-06 22:14:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:58,917 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 699 transitions. [2023-11-06 22:14:58,917 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:14:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 699 transitions. [2023-11-06 22:14:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:14:58,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:58,919 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:14:58,920 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:58,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1313920989, now seen corresponding path program 1 times [2023-11-06 22:14:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500020398] [2023-11-06 22:14:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:14:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:14:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500020398] [2023-11-06 22:14:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500020398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:14:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907609318] [2023-11-06 22:14:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:14:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:14:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:14:59,892 INFO L87 Difference]: Start difference. First operand 486 states and 699 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:02,128 INFO L93 Difference]: Finished difference Result 1380 states and 1988 transitions. [2023-11-06 22:15:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:15:02,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2023-11-06 22:15:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:02,135 INFO L225 Difference]: With dead ends: 1380 [2023-11-06 22:15:02,136 INFO L226 Difference]: Without dead ends: 922 [2023-11-06 22:15:02,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:15:02,138 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 374 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:02,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1708 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:15:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-11-06 22:15:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 510. [2023-11-06 22:15:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 468 states have (on average 1.420940170940171) internal successors, (665), 468 states have internal predecessors, (665), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:15:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 737 transitions. [2023-11-06 22:15:02,202 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 737 transitions. Word has length 104 [2023-11-06 22:15:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:02,202 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 737 transitions. [2023-11-06 22:15:02,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 737 transitions. [2023-11-06 22:15:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:15:02,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:02,205 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:02,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:15:02,205 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:02,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1532775707, now seen corresponding path program 1 times [2023-11-06 22:15:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808427737] [2023-11-06 22:15:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:15:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:15:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:15:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:15:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:15:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:15:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:15:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:15:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:15:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:15:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808427737] [2023-11-06 22:15:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808427737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:15:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96956844] [2023-11-06 22:15:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:02,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:15:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:15:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:15:02,912 INFO L87 Difference]: Start difference. First operand 510 states and 737 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:03,469 INFO L93 Difference]: Finished difference Result 840 states and 1225 transitions. [2023-11-06 22:15:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:15:03,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2023-11-06 22:15:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:03,473 INFO L225 Difference]: With dead ends: 840 [2023-11-06 22:15:03,473 INFO L226 Difference]: Without dead ends: 509 [2023-11-06 22:15:03,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:15:03,474 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 294 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:03,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 532 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:15:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-11-06 22:15:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 315. [2023-11-06 22:15:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 283 states have (on average 1.3957597173144876) internal successors, (395), 283 states have internal predecessors, (395), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:15:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 449 transitions. [2023-11-06 22:15:03,499 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 449 transitions. Word has length 104 [2023-11-06 22:15:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:03,499 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 449 transitions. [2023-11-06 22:15:03,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 449 transitions. [2023-11-06 22:15:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 22:15:03,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:03,501 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:03,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:15:03,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:03,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2063963853, now seen corresponding path program 1 times [2023-11-06 22:15:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219161195] [2023-11-06 22:15:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:15:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:15:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:15:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:15:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:15:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:15:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:15:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:15:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:15:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:15:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:03,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219161195] [2023-11-06 22:15:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219161195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:03,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910215532] [2023-11-06 22:15:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:03,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:03,599 INFO L87 Difference]: Start difference. First operand 315 states and 449 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:03,630 INFO L93 Difference]: Finished difference Result 608 states and 870 transitions. [2023-11-06 22:15:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2023-11-06 22:15:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:03,633 INFO L225 Difference]: With dead ends: 608 [2023-11-06 22:15:03,633 INFO L226 Difference]: Without dead ends: 341 [2023-11-06 22:15:03,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:03,635 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 16 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:03,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:15:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-06 22:15:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 317. [2023-11-06 22:15:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 285 states have (on average 1.3929824561403508) internal successors, (397), 285 states have internal predecessors, (397), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:15:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 451 transitions. [2023-11-06 22:15:03,660 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 451 transitions. Word has length 106 [2023-11-06 22:15:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:03,661 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 451 transitions. [2023-11-06 22:15:03,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:15:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 451 transitions. [2023-11-06 22:15:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 22:15:03,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:03,662 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:15:03,663 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:03,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1628443719, now seen corresponding path program 1 times [2023-11-06 22:15:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109881278] [2023-11-06 22:15:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:15:03,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:15:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:15:03,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:15:03,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:15:03,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:15:03,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:15:03,930 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, 1] [2023-11-06 22:15:03,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:15:04,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:15:04 BoogieIcfgContainer [2023-11-06 22:15:04,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:15:04,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:15:04,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:15:04,038 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:15:04,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:30" (3/4) ... [2023-11-06 22:15:04,041 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:15:04,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:15:04,043 INFO L158 Benchmark]: Toolchain (without parser) took 34982.66ms. Allocated memory was 151.0MB in the beginning and 509.6MB in the end (delta: 358.6MB). Free memory was 103.2MB in the beginning and 448.1MB in the end (delta: -344.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,043 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 151.0MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:15:04,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 151.0MB. Free memory was 102.9MB in the beginning and 87.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.26ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 83.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,044 INFO L158 Benchmark]: Boogie Preprocessor took 134.25ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 80.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,045 INFO L158 Benchmark]: RCFGBuilder took 1031.09ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.2MB in the beginning and 145.2MB in the end (delta: -65.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,045 INFO L158 Benchmark]: TraceAbstraction took 33243.33ms. Allocated memory was 201.3MB in the beginning and 509.6MB in the end (delta: 308.3MB). Free memory was 144.7MB in the beginning and 448.1MB in the end (delta: -303.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2023-11-06 22:15:04,045 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 509.6MB. Free memory is still 448.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:15:04,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 151.0MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 151.0MB. Free memory was 102.9MB in the beginning and 87.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.26ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 83.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.25ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 80.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1031.09ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.2MB in the beginning and 145.2MB in the end (delta: -65.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33243.33ms. Allocated memory was 201.3MB in the beginning and 509.6MB in the end (delta: 308.3MB). Free memory was 144.7MB in the beginning and 448.1MB in the end (delta: -303.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 509.6MB. Free memory is still 448.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_13 [L98] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L81] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L82] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00.var_1_5=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L84] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00.var_1_10=16401, WrapperStruct00.var_1_10=16401, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=16401, WrapperStruct00.var_1_10=16401, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=16401, WrapperStruct00.var_1_10=16401, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00.var_1_11=16399, WrapperStruct00.var_1_11=16399, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=16399, WrapperStruct00.var_1_11=16399, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=16399, WrapperStruct00.var_1_11=16399, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L91] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00.var_1_12=16402, WrapperStruct00.var_1_12=16402, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=16402, WrapperStruct00.var_1_12=16402, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=16402, WrapperStruct00.var_1_12=16402, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00.var_1_14=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00.var_1_14=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L109] RET updateVariables() [L110] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L55] COND FALSE !(WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) [L58] EXPR WrapperStruct00.var_1_7 [L58] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_7 [L59] EXPR WrapperStruct00.var_1_7 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_7; [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L60] COND TRUE ! WrapperStruct00.var_1_14 [L61] EXPR WrapperStruct00.var_1_8 [L61] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_11 [L69] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_16 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16; [L71] COND FALSE !(stepLocal_0 < -1) [L74] EXPR WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_1 = (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L76] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) [L101] EXPR WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) VAL [(((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) [L101] EXPR WrapperStruct00.var_1_5 VAL [((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1 VAL [((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) VAL [((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_16 VAL [(((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [(((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [(((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1 VAL [(((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) VAL [(((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) [L101] EXPR WrapperStruct00.var_1_14 VAL [((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))=1, (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_14=256, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) VAL [(! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))=1, ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))=1, (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_14=256, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [(! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))=1, ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))=1, (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_14=256, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_11 [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) VAL [(! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))=1, ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))=1, (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_11=16399, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_14=256, WrapperStruct00.var_1_15=16399, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) VAL [(! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))=1, ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7))=0, (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))=0, ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))=1, (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)=1, ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)=1, (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))=1, (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1=1, (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1=1, WrapperStruct00.var_1_11=16399, WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16)=0, WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_13=0, WrapperStruct00.var_1_14=256, WrapperStruct00.var_1_15=16399, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_1=-272, WrapperStruct00.var_1_5=16383, WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_7=200, WrapperStruct00.var_1_8=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101-L102] return ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4990 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4990 mSDsluCounter, 13814 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10728 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9800 IncrementalHoareTripleChecker+Invalid, 10296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 3086 mSDtfsCounter, 9800 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=19, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 2735 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 2322 NumberOfCodeBlocks, 2322 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2291 ConstructedInterpolants, 0 QuantifiedInterpolants, 7488 SizeOfPredicates, 6 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 3240/3312 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 22:15:04,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:15:06,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:15:07,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:15:07,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:15:07,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:15:07,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:15:07,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:15:07,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:15:07,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:15:07,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:15:07,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:15:07,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:15:07,087 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:15:07,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:15:07,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:15:07,091 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:15:07,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:15:07,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:15:07,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:15:07,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:15:07,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:15:07,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:15:07,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:15:07,096 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:15:07,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:15:07,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:15:07,097 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:15:07,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:15:07,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:15:07,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:15:07,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:07,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:15:07,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:15:07,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:15:07,102 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:15:07,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:15:07,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:15:07,103 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:15:07,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:15:07,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:15:07,105 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:15:07,105 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:15:07,105 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_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2023-11-06 22:15:07,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:15:07,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:15:07,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:15:07,604 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:15:07,605 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:15:07,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:15:10,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:15:11,166 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:15:11,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:15:11,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/3b0277d3a/5a51090d069443e889c52fca3e3fa4e2/FLAG7bbcfd8f6 [2023-11-06 22:15:11,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/data/3b0277d3a/5a51090d069443e889c52fca3e3fa4e2 [2023-11-06 22:15:11,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:15:11,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:15:11,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:11,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:15:11,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:15:11,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca3341f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11, skipping insertion in model container [2023-11-06 22:15:11,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,237 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:15:11,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_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2023-11-06 22:15:11,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:11,612 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:15:11,632 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_09539642-d5c7-48b7-bce1-999a2d214508/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2023-11-06 22:15:11,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:11,760 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:15:11,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11 WrapperNode [2023-11-06 22:15:11,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:11,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:11,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:15:11,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:15:11,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,891 INFO L138 Inliner]: procedures = 36, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 357 [2023-11-06 22:15:11,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:11,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:15:11,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:15:11,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:15:11,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:11,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:15:11,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:15:11,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:15:11,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:15:11,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (1/1) ... [2023-11-06 22:15:12,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:12,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:12,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:15:12,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:15:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:15:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:15:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:15:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:15:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:15:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:15:12,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:15:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:15:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:15:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:15:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:15:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:15:12,267 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:15:12,270 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:15:16,528 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:15:16,548 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:15:16,548 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:15:16,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:16 BoogieIcfgContainer [2023-11-06 22:15:16,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:15:16,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:15:16,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:15:16,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:15:16,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:11" (1/3) ... [2023-11-06 22:15:16,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52790f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:16, skipping insertion in model container [2023-11-06 22:15:16,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:11" (2/3) ... [2023-11-06 22:15:16,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52790f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:16, skipping insertion in model container [2023-11-06 22:15:16,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:16" (3/3) ... [2023-11-06 22:15:16,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2023-11-06 22:15:16,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:15:16,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:15:16,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:15:16,683 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;@42d745ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:15:16,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:15:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:15:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:15:16,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:16,704 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:16,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:16,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -757554800, now seen corresponding path program 1 times [2023-11-06 22:15:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:15:16,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387022681] [2023-11-06 22:15:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:16,732 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 22:15:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:15:16,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:16,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,078 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,279 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_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,286 INFO L158 Benchmark]: Toolchain (without parser) took 6087.94ms. Allocated memory is still 86.0MB. Free memory was 61.7MB in the beginning and 37.0MB in the end (delta: 24.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,287 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 65.0MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:15:17,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.72ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 64.2MB in the end (delta: -2.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.17ms. Allocated memory is still 86.0MB. Free memory was 64.2MB in the beginning and 60.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,290 INFO L158 Benchmark]: Boogie Preprocessor took 98.78ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 57.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,292 INFO L158 Benchmark]: RCFGBuilder took 4567.40ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 57.5MB in the end (delta: -378.6kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,299 INFO L158 Benchmark]: TraceAbstraction took 721.54ms. Allocated memory is still 86.0MB. Free memory was 56.7MB in the beginning and 37.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:15:17,306 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.32ms. Allocated memory is still 65.0MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.72ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 64.2MB in the end (delta: -2.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.17ms. Allocated memory is still 86.0MB. Free memory was 64.2MB in the beginning and 60.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.78ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 57.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 4567.40ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 57.5MB in the end (delta: -378.6kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 721.54ms. Allocated memory is still 86.0MB. Free memory was 56.7MB in the beginning and 37.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. 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_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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 22:15:17,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09539642-d5c7-48b7-bce1-999a2d214508/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_09539642-d5c7-48b7-bce1-999a2d214508/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.