./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:47:52,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:47:52,648 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:47:52,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:47:52,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:47:52,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:47:52,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:47:52,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:47:52,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:47:52,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:47:52,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:47:52,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:47:52,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:47:52,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:47:52,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:47:52,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:47:52,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:47:52,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:47:52,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:47:52,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:47:52,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:47:52,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:47:52,704 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2024-11-13 15:47:53,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:47:53,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:47:53,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:47:53,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:47:53,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:47:53,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i Unable to find full path for "g++" [2024-11-13 15:47:55,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:47:55,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:47:55,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-13 15:47:55,781 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/4a7e87101/6ebd767fdd33408094c6e28bd93fa1da/FLAG79865e211 [2024-11-13 15:47:55,799 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/4a7e87101/6ebd767fdd33408094c6e28bd93fa1da [2024-11-13 15:47:55,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:47:55,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:47:55,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:47:55,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:47:55,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:47:55,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:47:55" (1/1) ... [2024-11-13 15:47:55,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d222f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:55, skipping insertion in model container [2024-11-13 15:47:55,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:47:55" (1/1) ... [2024-11-13 15:47:55,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:47:56,050 WARN L250 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_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-13 15:47:56,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:47:56,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:47:56,161 WARN L250 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_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-13 15:47:56,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:47:56,239 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:47:56,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56 WrapperNode [2024-11-13 15:47:56,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:47:56,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:47:56,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:47:56,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:47:56,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,313 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-11-13 15:47:56,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:47:56,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:47:56,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:47:56,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:47:56,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,340 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 15:47:56,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:47:56,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:47:56,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:47:56,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:47:56,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (1/1) ... [2024-11-13 15:47:56,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:47:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:47:56,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:47:56,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:47:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:47:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 15:47:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:47:56,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:47:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 15:47:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:47:56,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:47:56,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:47:56,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:47:57,752 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-13 15:47:57,752 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:47:57,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:47:57,775 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:47:57,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:47:57 BoogieIcfgContainer [2024-11-13 15:47:57,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:47:57,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:47:57,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:47:57,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:47:57,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:47:55" (1/3) ... [2024-11-13 15:47:57,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b49666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:47:57, skipping insertion in model container [2024-11-13 15:47:57,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:47:56" (2/3) ... [2024-11-13 15:47:57,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b49666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:47:57, skipping insertion in model container [2024-11-13 15:47:57,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:47:57" (3/3) ... [2024-11-13 15:47:57,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-13 15:47:57,816 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:47:57,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-96.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:47:57,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:47:57,934 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@641a8eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:47:57,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:47:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:47:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:47:57,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:47:57,960 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:47:57,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:47:57,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:47:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1402862563, now seen corresponding path program 1 times [2024-11-13 15:47:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:47:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184261695] [2024-11-13 15:47:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:47:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:47:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:47:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:47:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:47:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:47:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:47:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:47:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:47:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:47:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:47:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:47:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:47:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:47:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:47:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:47:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:47:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:47:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:47:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:47:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184261695] [2024-11-13 15:47:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184261695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:47:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:47:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:47:58,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650634510] [2024-11-13 15:47:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:47:58,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:47:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:47:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:47:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:47:58,767 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:47:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:47:58,802 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-11-13 15:47:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:47:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-13 15:47:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:47:58,816 INFO L225 Difference]: With dead ends: 209 [2024-11-13 15:47:58,817 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:47:58,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:47:58,826 INFO L432 NwaCegarLoop]: 152 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, 152 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 [2024-11-13 15:47:58,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:47:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:47:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 15:47:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:47:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-13 15:47:58,887 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2024-11-13 15:47:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:47:58,887 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-13 15:47:58,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:47:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-13 15:47:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:47:58,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:47:58,892 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:47:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:47:58,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:47:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:47:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1234997567, now seen corresponding path program 1 times [2024-11-13 15:47:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:47:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144072194] [2024-11-13 15:47:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:47:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:47:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:47:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:47:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:47:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:47:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:47:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:47:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:47:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:47:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:47:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:47:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:47:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:47:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:47:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:47:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:47:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:47:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:47:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:47:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:47:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144072194] [2024-11-13 15:47:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144072194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:47:59,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:47:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:47:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510832467] [2024-11-13 15:47:59,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:47:59,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:47:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:47:59,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:47:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:47:59,625 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:47:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:47:59,721 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2024-11-13 15:47:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:47:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-13 15:47:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:47:59,724 INFO L225 Difference]: With dead ends: 207 [2024-11-13 15:47:59,724 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 15:47:59,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:47:59,728 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:47:59,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:47:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 15:47:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 15:47:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:47:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-13 15:47:59,757 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2024-11-13 15:47:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:47:59,759 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-13 15:47:59,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:47:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-13 15:47:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:47:59,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:47:59,762 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:47:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:47:59,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:47:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:47:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2128483905, now seen corresponding path program 1 times [2024-11-13 15:47:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:47:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42450196] [2024-11-13 15:47:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:47:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:47:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:00,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42450196] [2024-11-13 15:48:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42450196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:00,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:00,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12222295] [2024-11-13 15:48:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:00,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:00,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:00,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:00,270 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:00,343 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-13 15:48:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:00,349 INFO L225 Difference]: With dead ends: 212 [2024-11-13 15:48:00,349 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 15:48:00,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:00,355 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:00,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 15:48:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-13 15:48:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-13 15:48:00,369 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2024-11-13 15:48:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-13 15:48:00,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-13 15:48:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:00,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:00,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:00,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:48:00,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1448425535, now seen corresponding path program 1 times [2024-11-13 15:48:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123525538] [2024-11-13 15:48:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123525538] [2024-11-13 15:48:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123525538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704632787] [2024-11-13 15:48:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:00,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:00,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:00,783 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:00,831 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-13 15:48:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:00,835 INFO L225 Difference]: With dead ends: 216 [2024-11-13 15:48:00,835 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:48:00,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:00,843 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:00,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:48:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-13 15:48:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-13 15:48:00,860 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2024-11-13 15:48:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:00,861 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-13 15:48:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-13 15:48:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:00,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:00,869 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:48:00,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 326581827, now seen corresponding path program 1 times [2024-11-13 15:48:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835682016] [2024-11-13 15:48:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835682016] [2024-11-13 15:48:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835682016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125582629] [2024-11-13 15:48:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:01,335 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:01,390 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-13 15:48:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:01,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:01,393 INFO L225 Difference]: With dead ends: 220 [2024-11-13 15:48:01,393 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 15:48:01,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:01,398 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:01,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 15:48:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-13 15:48:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-13 15:48:01,420 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-13 15:48:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-13 15:48:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-13 15:48:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:01,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:01,423 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:01,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:48:01,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 328428869, now seen corresponding path program 1 times [2024-11-13 15:48:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:01,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720543649] [2024-11-13 15:48:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720543649] [2024-11-13 15:48:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720543649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:48:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584984972] [2024-11-13 15:48:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:48:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:48:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:02,039 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:02,566 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2024-11-13 15:48:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:48:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:02,569 INFO L225 Difference]: With dead ends: 223 [2024-11-13 15:48:02,569 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:48:02,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:02,570 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:02,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:48:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:48:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 15:48:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-13 15:48:02,584 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-13 15:48:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:02,609 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-13 15:48:02,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-13 15:48:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:02,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:02,611 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:02,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:48:02,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1360514873, now seen corresponding path program 1 times [2024-11-13 15:48:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782852973] [2024-11-13 15:48:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782852973] [2024-11-13 15:48:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782852973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:48:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591380473] [2024-11-13 15:48:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:08,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:48:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:48:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:48:08,163 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-13 15:48:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:09,548 INFO L93 Difference]: Finished difference Result 286 states and 408 transitions. [2024-11-13 15:48:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:48:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2024-11-13 15:48:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:09,553 INFO L225 Difference]: With dead ends: 286 [2024-11-13 15:48:09,553 INFO L226 Difference]: Without dead ends: 175 [2024-11-13 15:48:09,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:48:09,556 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 293 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:09,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 431 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:48:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-13 15:48:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2024-11-13 15:48:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-11-13 15:48:09,596 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 131 [2024-11-13 15:48:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-11-13 15:48:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-13 15:48:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-11-13 15:48:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:48:09,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:09,603 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:48:09,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2018295971, now seen corresponding path program 1 times [2024-11-13 15:48:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:09,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762634252] [2024-11-13 15:48:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762634252] [2024-11-13 15:48:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762634252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:10,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406726803] [2024-11-13 15:48:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:10,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:10,441 INFO L87 Difference]: Start difference. First operand 126 states and 180 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:10,522 INFO L93 Difference]: Finished difference Result 247 states and 355 transitions. [2024-11-13 15:48:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 15:48:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:10,526 INFO L225 Difference]: With dead ends: 247 [2024-11-13 15:48:10,526 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 15:48:10,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:10,527 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:10,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 15:48:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-13 15:48:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-13 15:48:10,552 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 133 [2024-11-13 15:48:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:10,553 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-13 15:48:10,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-13 15:48:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:48:10,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:10,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:48:10,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1595594145, now seen corresponding path program 1 times [2024-11-13 15:48:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114915695] [2024-11-13 15:48:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:10,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114915695] [2024-11-13 15:48:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114915695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:10,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:48:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19021673] [2024-11-13 15:48:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:48:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:48:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:10,821 INFO L87 Difference]: Start difference. First operand 124 states and 176 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:11,261 INFO L93 Difference]: Finished difference Result 243 states and 345 transitions. [2024-11-13 15:48:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:48:11,265 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 15:48:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:11,268 INFO L225 Difference]: With dead ends: 243 [2024-11-13 15:48:11,268 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 15:48:11,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:11,269 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:11,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 464 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:48:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 15:48:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-13 15:48:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2024-11-13 15:48:11,291 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 133 [2024-11-13 15:48:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2024-11-13 15:48:11,294 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2024-11-13 15:48:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:48:11,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:11,296 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:11,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:48:11,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1745483454, now seen corresponding path program 1 times [2024-11-13 15:48:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044657351] [2024-11-13 15:48:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044657351] [2024-11-13 15:48:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044657351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:48:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749210673] [2024-11-13 15:48:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:48:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:48:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:11,474 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:11,519 INFO L93 Difference]: Finished difference Result 289 states and 402 transitions. [2024-11-13 15:48:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:48:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 15:48:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:11,522 INFO L225 Difference]: With dead ends: 289 [2024-11-13 15:48:11,522 INFO L226 Difference]: Without dead ends: 170 [2024-11-13 15:48:11,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:11,523 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:11,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-13 15:48:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2024-11-13 15:48:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2024-11-13 15:48:11,551 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 180 transitions. Word has length 133 [2024-11-13 15:48:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:11,552 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 180 transitions. [2024-11-13 15:48:11,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2024-11-13 15:48:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:48:11,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:11,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:48:11,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash -204852795, now seen corresponding path program 1 times [2024-11-13 15:48:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311290697] [2024-11-13 15:48:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:11,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:11,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311290697] [2024-11-13 15:48:11,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311290697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:11,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:11,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:48:11,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677701807] [2024-11-13 15:48:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:11,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:48:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:11,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:48:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:11,880 INFO L87 Difference]: Start difference. First operand 131 states and 180 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:11,927 INFO L93 Difference]: Finished difference Result 262 states and 361 transitions. [2024-11-13 15:48:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:48:11,928 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 15:48:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:11,929 INFO L225 Difference]: With dead ends: 262 [2024-11-13 15:48:11,929 INFO L226 Difference]: Without dead ends: 134 [2024-11-13 15:48:11,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:11,931 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-13 15:48:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-13 15:48:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 116 states have internal predecessors, (151), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-11-13 15:48:11,948 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 133 [2024-11-13 15:48:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:11,949 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-11-13 15:48:11,949 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-11-13 15:48:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:48:11,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:11,951 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:11,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:48:11,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747648, now seen corresponding path program 1 times [2024-11-13 15:48:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844187080] [2024-11-13 15:48:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844187080] [2024-11-13 15:48:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844187080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:48:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501217383] [2024-11-13 15:48:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:48:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:48:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:12,104 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:12,334 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2024-11-13 15:48:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:48:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 15:48:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:12,339 INFO L225 Difference]: With dead ends: 307 [2024-11-13 15:48:12,340 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 15:48:12,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:12,341 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:12,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:48:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 15:48:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2024-11-13 15:48:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.293103448275862) internal successors, (150), 116 states have internal predecessors, (150), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2024-11-13 15:48:12,364 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 133 [2024-11-13 15:48:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2024-11-13 15:48:12,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2024-11-13 15:48:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 15:48:12,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:12,371 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:12,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:48:12,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:12,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 411846596, now seen corresponding path program 1 times [2024-11-13 15:48:12,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:12,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043145044] [2024-11-13 15:48:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:12,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043145044] [2024-11-13 15:48:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043145044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:12,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:12,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:48:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269433019] [2024-11-13 15:48:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:12,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:48:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:48:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:12,937 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:13,584 INFO L93 Difference]: Finished difference Result 271 states and 369 transitions. [2024-11-13 15:48:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:48:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-13 15:48:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:13,587 INFO L225 Difference]: With dead ends: 271 [2024-11-13 15:48:13,587 INFO L226 Difference]: Without dead ends: 140 [2024-11-13 15:48:13,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:48:13,589 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 12 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:13,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 447 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:48:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-13 15:48:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2024-11-13 15:48:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2024-11-13 15:48:13,614 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 134 [2024-11-13 15:48:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:13,615 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2024-11-13 15:48:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2024-11-13 15:48:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 15:48:13,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:13,618 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:13,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:48:13,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:13,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2087311045, now seen corresponding path program 1 times [2024-11-13 15:48:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989125493] [2024-11-13 15:48:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989125493] [2024-11-13 15:48:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989125493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905091997] [2024-11-13 15:48:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:14,394 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:14,739 INFO L93 Difference]: Finished difference Result 380 states and 512 transitions. [2024-11-13 15:48:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-13 15:48:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:14,742 INFO L225 Difference]: With dead ends: 380 [2024-11-13 15:48:14,742 INFO L226 Difference]: Without dead ends: 249 [2024-11-13 15:48:14,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:14,744 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:14,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:48:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-13 15:48:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 186. [2024-11-13 15:48:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 151 states have internal predecessors, (189), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 253 transitions. [2024-11-13 15:48:14,782 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 253 transitions. Word has length 135 [2024-11-13 15:48:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 253 transitions. [2024-11-13 15:48:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 253 transitions. [2024-11-13 15:48:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:48:14,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:14,785 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:14,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:48:14,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 912229201, now seen corresponding path program 1 times [2024-11-13 15:48:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:14,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968757664] [2024-11-13 15:48:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968757664] [2024-11-13 15:48:14,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968757664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:14,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:14,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:48:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222164796] [2024-11-13 15:48:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:14,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:14,987 INFO L87 Difference]: Start difference. First operand 186 states and 253 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:15,078 INFO L93 Difference]: Finished difference Result 360 states and 488 transitions. [2024-11-13 15:48:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-13 15:48:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:15,081 INFO L225 Difference]: With dead ends: 360 [2024-11-13 15:48:15,081 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 15:48:15,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:15,083 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 55 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:15,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 411 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 15:48:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 191. [2024-11-13 15:48:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 156 states have internal predecessors, (197), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 261 transitions. [2024-11-13 15:48:15,122 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 261 transitions. Word has length 136 [2024-11-13 15:48:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 261 transitions. [2024-11-13 15:48:15,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 261 transitions. [2024-11-13 15:48:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:48:15,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:15,125 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:15,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:48:15,125 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -108839153, now seen corresponding path program 1 times [2024-11-13 15:48:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:15,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157843864] [2024-11-13 15:48:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:15,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157843864] [2024-11-13 15:48:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157843864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:15,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:15,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:48:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985962478] [2024-11-13 15:48:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:48:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:48:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:15,451 INFO L87 Difference]: Start difference. First operand 191 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:15,526 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2024-11-13 15:48:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:48:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-13 15:48:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:15,529 INFO L225 Difference]: With dead ends: 331 [2024-11-13 15:48:15,529 INFO L226 Difference]: Without dead ends: 195 [2024-11-13 15:48:15,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:15,530 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-13 15:48:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-13 15:48:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 157 states have internal predecessors, (198), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 262 transitions. [2024-11-13 15:48:15,568 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 262 transitions. Word has length 136 [2024-11-13 15:48:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:15,569 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 262 transitions. [2024-11-13 15:48:15,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 262 transitions. [2024-11-13 15:48:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:48:15,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:15,571 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:48:15,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 469745535, now seen corresponding path program 1 times [2024-11-13 15:48:15,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218207530] [2024-11-13 15:48:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218207530] [2024-11-13 15:48:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218207530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:48:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559135395] [2024-11-13 15:48:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:48:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:48:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:15,892 INFO L87 Difference]: Start difference. First operand 192 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:15,934 INFO L93 Difference]: Finished difference Result 329 states and 448 transitions. [2024-11-13 15:48:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:48:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-13 15:48:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:15,937 INFO L225 Difference]: With dead ends: 329 [2024-11-13 15:48:15,937 INFO L226 Difference]: Without dead ends: 192 [2024-11-13 15:48:15,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:48:15,938 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:15,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-13 15:48:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-13 15:48:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 157 states have internal predecessors, (196), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 260 transitions. [2024-11-13 15:48:15,980 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 260 transitions. Word has length 136 [2024-11-13 15:48:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:15,980 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 260 transitions. [2024-11-13 15:48:15,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 260 transitions. [2024-11-13 15:48:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:48:15,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:15,983 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:15,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:48:15,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:15,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 688600253, now seen corresponding path program 1 times [2024-11-13 15:48:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101729292] [2024-11-13 15:48:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101729292] [2024-11-13 15:48:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101729292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:21,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:48:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816006117] [2024-11-13 15:48:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:48:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:48:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:48:21,474 INFO L87 Difference]: Start difference. First operand 192 states and 260 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-13 15:48:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:23,382 INFO L93 Difference]: Finished difference Result 369 states and 495 transitions. [2024-11-13 15:48:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:48:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 136 [2024-11-13 15:48:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:23,385 INFO L225 Difference]: With dead ends: 369 [2024-11-13 15:48:23,386 INFO L226 Difference]: Without dead ends: 232 [2024-11-13 15:48:23,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:48:23,389 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 273 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:23,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:48:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-13 15:48:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 184. [2024-11-13 15:48:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 149 states have (on average 1.25503355704698) internal successors, (187), 149 states have internal predecessors, (187), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-13 15:48:23,430 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 136 [2024-11-13 15:48:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:23,431 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-13 15:48:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-13 15:48:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-13 15:48:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 15:48:23,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:23,433 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:48:23,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 268008808, now seen corresponding path program 1 times [2024-11-13 15:48:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296302875] [2024-11-13 15:48:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:23,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296302875] [2024-11-13 15:48:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296302875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:48:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463323732] [2024-11-13 15:48:23,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:48:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:48:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:23,666 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:24,171 INFO L93 Difference]: Finished difference Result 313 states and 426 transitions. [2024-11-13 15:48:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:48:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-13 15:48:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:24,174 INFO L225 Difference]: With dead ends: 313 [2024-11-13 15:48:24,174 INFO L226 Difference]: Without dead ends: 184 [2024-11-13 15:48:24,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:24,176 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 45 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:24,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 391 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:48:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-13 15:48:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-13 15:48:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 149 states have internal predecessors, (186), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2024-11-13 15:48:24,207 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 137 [2024-11-13 15:48:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2024-11-13 15:48:24,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2024-11-13 15:48:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 15:48:24,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:24,210 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:24,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:48:24,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:24,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash -743108442, now seen corresponding path program 1 times [2024-11-13 15:48:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561705914] [2024-11-13 15:48:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:48:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:48:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:48:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:48:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:48:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:48:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:48:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:48:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:48:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:48:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:48:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:48:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:48:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:48:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:48:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:48:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:24,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561705914] [2024-11-13 15:48:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561705914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:24,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:48:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685954256] [2024-11-13 15:48:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:24,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:48:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:48:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:48:24,781 INFO L87 Difference]: Start difference. First operand 184 states and 250 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:25,224 INFO L93 Difference]: Finished difference Result 189 states and 255 transitions. [2024-11-13 15:48:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:48:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-13 15:48:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:25,227 INFO L225 Difference]: With dead ends: 189 [2024-11-13 15:48:25,227 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 15:48:25,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:48:25,228 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 137 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 494 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:48:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 15:48:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-13 15:48:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.243421052631579) internal successors, (189), 152 states have internal predecessors, (189), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 15:48:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2024-11-13 15:48:25,261 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 137 [2024-11-13 15:48:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:25,262 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2024-11-13 15:48:25,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2024-11-13 15:48:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 15:48:25,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:25,264 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:25,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:48:25,264 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:25,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash -741261400, now seen corresponding path program 1 times [2024-11-13 15:48:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339329730] [2024-11-13 15:48:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:48:25,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:48:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:48:25,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:48:25,608 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:48:25,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:48:25,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:48:25,614 INFO L407 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] [2024-11-13 15:48:25,852 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:48:25,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:48:25 BoogieIcfgContainer [2024-11-13 15:48:25,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:48:25,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:48:25,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:48:25,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:48:25,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:47:57" (3/4) ... [2024-11-13 15:48:25,865 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:48:25,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:48:25,867 INFO L158 Benchmark]: Toolchain (without parser) took 30064.09ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 91.7MB in the beginning and 286.8MB in the end (delta: -195.1MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,867 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 41.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:48:25,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.02ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.62ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 72.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:48:25,869 INFO L158 Benchmark]: Boogie Preprocessor took 75.07ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,869 INFO L158 Benchmark]: RCFGBuilder took 1387.95ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 86.9MB in the end (delta: -17.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,869 INFO L158 Benchmark]: TraceAbstraction took 28079.79ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 86.1MB in the beginning and 286.8MB in the end (delta: -200.7MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,870 INFO L158 Benchmark]: Witness Printer took 5.85ms. Allocated memory is still 402.7MB. Free memory was 286.8MB in the beginning and 286.8MB in the end (delta: 35.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:48:25,871 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.55ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 41.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.02ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.62ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 72.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.07ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1387.95ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 86.9MB in the end (delta: -17.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28079.79ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 86.1MB in the beginning and 286.8MB in the end (delta: -200.7MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Witness Printer took 5.85ms. Allocated memory is still 402.7MB. Free memory was 286.8MB in the beginning and 286.8MB in the end (delta: 35.3kB). Peak memory consumption was 8.4MB. 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 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L61] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L62] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned char last_1_WrapperStruct00_var_1_5 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=0, last_1_WrapperStruct00_var_1_5=1] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L130] EXPR WrapperStruct00.var_1_5 [L130] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L115] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L121] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L123] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L125] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L126] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L141] RET updateVariables() [L142] CALL step() [L76] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L82] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L91] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_1_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] COND FALSE !((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133-L134] return ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1153 mSDsluCounter, 8176 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5391 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 2785 mSDtfsCounter, 1888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=16, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 291 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 2806 NumberOfCodeBlocks, 2806 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2649 ConstructedInterpolants, 0 QuantifiedInterpolants, 10695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9600/9600 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 [2024-11-13 15:48:25,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:48:28,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:48:28,773 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:48:28,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:48:28,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:48:28,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:48:28,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:48:28,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:48:28,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:48:28,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:48:28,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:48:28,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:48:28,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:48:28,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:48:28,838 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:48:28,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:48:28,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:48:28,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:48:28,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:48:28,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:48:28,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:48:28,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:48:28,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:48:28,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:48:28,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:48:28,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:48:28,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:48:28,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:48:28,843 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:48:28,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:48:28,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:48:28,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:48:28,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:48:28,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:48:28,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2024-11-13 15:48:29,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:48:29,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:48:29,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:48:29,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:48:29,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:48:29,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i Unable to find full path for "g++" [2024-11-13 15:48:31,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:48:31,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:48:31,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-13 15:48:31,703 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/881a0a3fb/ba9f65831c79430783a279f4e1a0da17/FLAG52032c07e [2024-11-13 15:48:31,730 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/data/881a0a3fb/ba9f65831c79430783a279f4e1a0da17 [2024-11-13 15:48:31,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:48:31,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:48:31,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:48:31,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:48:31,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:48:31,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:48:31" (1/1) ... [2024-11-13 15:48:31,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139189a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:31, skipping insertion in model container [2024-11-13 15:48:31,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:48:31" (1/1) ... [2024-11-13 15:48:31,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:48:31,961 WARN L250 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_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-13 15:48:32,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:48:32,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:48:32,098 WARN L250 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_8867e10f-5bd1-435c-8161-c73c87697cbc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-13 15:48:32,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:48:32,204 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:48:32,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32 WrapperNode [2024-11-13 15:48:32,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:48:32,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:48:32,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:48:32,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:48:32,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,282 INFO L138 Inliner]: procedures = 40, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-13 15:48:32,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:48:32,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:48:32,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:48:32,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:48:32,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,364 INFO L175 MemorySlicer]: Split 128 memory accesses to 2 slices as follows [2, 126]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-13 15:48:32,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:48:32,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:48:32,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:48:32,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:48:32,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (1/1) ... [2024-11-13 15:48:32,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:48:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:48:32,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:48:32,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:48:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 15:48:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-13 15:48:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:48:32,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:48:32,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:48:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:48:32,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:48:32,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:48:35,412 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-13 15:48:35,412 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:48:35,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:48:35,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:48:35,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:48:35 BoogieIcfgContainer [2024-11-13 15:48:35,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:48:35,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:48:35,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:48:35,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:48:35,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:48:31" (1/3) ... [2024-11-13 15:48:35,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7071007c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:48:35, skipping insertion in model container [2024-11-13 15:48:35,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:48:32" (2/3) ... [2024-11-13 15:48:35,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7071007c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:48:35, skipping insertion in model container [2024-11-13 15:48:35,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:48:35" (3/3) ... [2024-11-13 15:48:35,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-13 15:48:35,474 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:48:35,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-96.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:48:35,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:48:35,578 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5645596d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:48:35,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:48:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:35,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:35,604 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:35,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 864937929, now seen corresponding path program 1 times [2024-11-13 15:48:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935992163] [2024-11-13 15:48:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:35,625 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 [2024-11-13 15:48:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:35,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:35,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:36,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:48:36,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-13 15:48:36,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:48:36,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:48:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935992163] [2024-11-13 15:48:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935992163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:48:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357847578] [2024-11-13 15:48:36,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:48:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:48:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:48:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:48:36,488 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:48:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:36,548 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-11-13 15:48:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:48:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-13 15:48:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:36,565 INFO L225 Difference]: With dead ends: 209 [2024-11-13 15:48:36,566 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:48:36,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:48:36,576 INFO L432 NwaCegarLoop]: 152 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, 152 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 [2024-11-13 15:48:36,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:48:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:48:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 15:48:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-13 15:48:36,634 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2024-11-13 15:48:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:36,635 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-13 15:48:36,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:48:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-13 15:48:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:36,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:36,639 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:36,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 15:48:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:36,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1032802925, now seen corresponding path program 1 times [2024-11-13 15:48:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835300105] [2024-11-13 15:48:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:36,846 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 [2024-11-13 15:48:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:36,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:36,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 15:48:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:37,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:48:37,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:37,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:48:37,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:48:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835300105] [2024-11-13 15:48:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835300105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:48:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708267474] [2024-11-13 15:48:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:37,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:48:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:48:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:48:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:37,534 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:37,670 INFO L93 Difference]: Finished difference Result 210 states and 308 transitions. [2024-11-13 15:48:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:48:37,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:37,674 INFO L225 Difference]: With dead ends: 210 [2024-11-13 15:48:37,675 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 15:48:37,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:37,677 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:37,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 572 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:48:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 15:48:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-13 15:48:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-13 15:48:37,700 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2024-11-13 15:48:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:37,702 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-13 15:48:37,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-13 15:48:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:37,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:37,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:37,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 15:48:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:37,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:37,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1712861295, now seen corresponding path program 1 times [2024-11-13 15:48:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118154760] [2024-11-13 15:48:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:37,909 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 [2024-11-13 15:48:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:37,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:37,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (4)] Waiting until timeout for monitored process [2024-11-13 15:48:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:38,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:48:38,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:38,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:48:38,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:48:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118154760] [2024-11-13 15:48:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118154760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:48:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729069349] [2024-11-13 15:48:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:38,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:48:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:48:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:48:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:38,627 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:39,060 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-13 15:48:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:48:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:39,064 INFO L225 Difference]: With dead ends: 216 [2024-11-13 15:48:39,064 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:48:39,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:48:39,066 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:39,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 705 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:48:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:48:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-13 15:48:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-13 15:48:39,080 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2024-11-13 15:48:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:39,081 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-13 15:48:39,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-13 15:48:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:39,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:39,084 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:39,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (4)] Forceful destruction successful, exit code 0 [2024-11-13 15:48:39,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:39,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash -807098639, now seen corresponding path program 1 times [2024-11-13 15:48:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:39,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104309337] [2024-11-13 15:48:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:39,291 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 [2024-11-13 15:48:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:39,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:39,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (5)] Waiting until timeout for monitored process [2024-11-13 15:48:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:39,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:48:39,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:39,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:48:39,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:48:39,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104309337] [2024-11-13 15:48:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104309337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:39,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:39,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:48:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992309102] [2024-11-13 15:48:39,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:39,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:48:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:48:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:48:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:48:39,961 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:40,335 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-13 15:48:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:48:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:40,337 INFO L225 Difference]: With dead ends: 220 [2024-11-13 15:48:40,338 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 15:48:40,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:48:40,343 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:40,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 839 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:48:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 15:48:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-13 15:48:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-13 15:48:40,369 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-13 15:48:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:40,370 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-13 15:48:40,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-13 15:48:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:40,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:40,377 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:40,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (5)] Forceful destruction successful, exit code 0 [2024-11-13 15:48:40,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:40,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -805251597, now seen corresponding path program 1 times [2024-11-13 15:48:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99529375] [2024-11-13 15:48:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:40,580 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 [2024-11-13 15:48:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:40,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:40,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (6)] Waiting until timeout for monitored process [2024-11-13 15:48:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:41,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 15:48:41,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:45,718 INFO L349 Elim1Store]: treesize reduction 80, result has 26.6 percent of original size [2024-11-13 15:48:45,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 39 [2024-11-13 15:48:45,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:48:45,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-13 15:48:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 15:48:45,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:48:45,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:48:45,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99529375] [2024-11-13 15:48:45,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99529375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:45,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:48:45,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216786842] [2024-11-13 15:48:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:45,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:48:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:48:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:48:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:48:45,854 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:46,391 INFO L93 Difference]: Finished difference Result 221 states and 317 transitions. [2024-11-13 15:48:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:48:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-13 15:48:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:46,395 INFO L225 Difference]: With dead ends: 221 [2024-11-13 15:48:46,395 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 15:48:46,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:48:46,397 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 85 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:46,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:48:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 15:48:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-13 15:48:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:48:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-13 15:48:46,428 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 131 [2024-11-13 15:48:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:46,429 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-13 15:48:46,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 15:48:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-13 15:48:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:48:46,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:46,438 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:48:46,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (6)] Forceful destruction successful, exit code 0 [2024-11-13 15:48:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:48:46,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:48:46,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1800771957, now seen corresponding path program 1 times [2024-11-13 15:48:46,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:48:46,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275476733] [2024-11-13 15:48:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:46,641 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 [2024-11-13 15:48:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:48:46,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:48:46,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/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 (7)] Waiting until timeout for monitored process [2024-11-13 15:48:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:47,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 15:48:47,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:48:50,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:48:51,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 15:48:53,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 15:48:54,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 15:48:55,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-13 15:48:56,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-11-13 15:49:01,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-13 15:49:02,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2024-11-13 15:49:02,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2024-11-13 15:49:03,321 INFO L349 Elim1Store]: treesize reduction 226, result has 6.2 percent of original size [2024-11-13 15:49:03,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 174 treesize of output 306 [2024-11-13 15:49:04,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 85 [2024-11-13 15:49:05,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2024-11-13 15:49:06,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:49:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 268 treesize of output 204 [2024-11-13 15:49:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 15:49:38,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:44,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:49:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275476733] [2024-11-13 15:49:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275476733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266352937] [2024-11-13 15:49:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:44,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:44,385 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:44,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8867e10f-5bd1-435c-8161-c73c87697cbc/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:49:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:49:45,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:52,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 15:49:52,919 INFO L349 Elim1Store]: treesize reduction 261, result has 25.2 percent of original size [2024-11-13 15:49:52,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 202 treesize of output 318 [2024-11-13 15:49:53,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:54,027 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 15:49:54,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 98 [2024-11-13 15:49:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 15:49:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:54,253 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-13 15:49:54,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 77 [2024-11-13 15:49:54,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:54,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2024-11-13 15:49:54,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 86 [2024-11-13 15:49:54,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2024-11-13 15:49:55,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:55,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-11-13 15:49:55,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:49:55,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:55,869 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-13 15:49:55,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 163 treesize of output 203 [2024-11-13 15:50:00,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:50:00,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:50:00,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:50:00,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:50:00,893 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-11-13 15:50:00,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 68 [2024-11-13 15:50:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 15:50:00,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-13 16:00:26,143 WARN L286 SmtUtils]: Spent 10.07m on a formula simplification that was a NOOP. DAG size: 7443 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 16:00:26,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:00:26,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 61 select indices, 61 select index equivalence classes, 0 disjoint index pairs (out of 1830 index pairs), introduced 61 new quantified variables, introduced 1830 case distinctions, treesize of input 2995 treesize of output 16821 [2024-11-13 16:00:31,393 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 8069 DAG size of output: 8068 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:32,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 2148 treesize of output 2138 [2024-11-13 16:00:39,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 2138 treesize of output 2112 [2024-11-13 16:00:44,126 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 8065 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:45,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 2112 treesize of output 2100 [2024-11-13 16:00:50,324 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 8064 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:51,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 2100 treesize of output 2074