./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:17:55,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:17:55,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:17:55,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:17:55,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:17:55,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:17:55,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:17:55,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:17:55,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:17:55,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:17:55,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:17:55,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:17:55,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:17:55,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:17:55,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:17:55,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:17:55,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:17:55,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:17:55,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:17:55,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:17:55,164 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:17:55,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:17:55,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:17:55,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:17:55,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:17:55,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:17:55,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:17:55,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:17:55,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:17:55,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:17:55,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:17:55,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:17:55,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:17:55,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:17:55,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:17:55,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:17:55,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:17:55,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:17:55,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:17:55,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:17:55,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:17:55,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:17:55,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:17:55,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:17:55,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:17:55,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:17:55,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:17:55,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:17:55,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:17:55,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:17:55,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:17:55,241 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:17:55,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:17:55,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:17:55,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:17:55,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:17:55,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:17:55,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:17:55,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:17:55,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:17:55,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:17:55,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:17:55,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:17:55,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:17:55,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:17:55,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:17:55,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:17:55,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:17:55,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:17:55,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:17:55,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:17:55,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:17:55,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:17:55,253 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:17:55,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:17:55,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:17:55,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2022-07-13 18:17:55,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:17:55,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:17:55,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:17:55,622 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:17:55,623 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:17:55,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-13 18:17:55,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927d13ec8/2eb1bf78f75e451391006b7cd6717fd4/FLAGefde0da2d [2022-07-13 18:17:56,332 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:17:56,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-13 18:17:56,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927d13ec8/2eb1bf78f75e451391006b7cd6717fd4/FLAGefde0da2d [2022-07-13 18:17:56,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927d13ec8/2eb1bf78f75e451391006b7cd6717fd4 [2022-07-13 18:17:56,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:17:56,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:17:56,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:17:56,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:17:56,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:17:56,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:56,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535e423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56, skipping insertion in model container [2022-07-13 18:17:56,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:56,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:17:56,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:17:56,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-07-13 18:17:56,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:17:56,812 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:17:56,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-07-13 18:17:56,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:17:56,913 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:17:56,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56 WrapperNode [2022-07-13 18:17:56,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:17:56,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:17:56,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:17:56,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:17:56,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:56,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,003 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2022-07-13 18:17:57,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:17:57,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:17:57,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:17:57,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:17:57,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:17:57,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:17:57,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:17:57,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:17:57,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (1/1) ... [2022-07-13 18:17:57,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:17:57,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:17:57,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:17:57,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:17:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-13 18:17:57,196 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-13 18:17:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:17:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-13 18:17:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-13 18:17:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-13 18:17:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-13 18:17:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-13 18:17:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-13 18:17:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 18:17:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 18:17:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:17:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-13 18:17:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-13 18:17:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:17:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:17:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-13 18:17:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-13 18:17:57,358 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:17:57,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:17:58,116 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:17:58,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:17:58,126 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 18:17:58,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:17:58 BoogieIcfgContainer [2022-07-13 18:17:58,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:17:58,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:17:58,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:17:58,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:17:58,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:17:56" (1/3) ... [2022-07-13 18:17:58,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d6cb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:17:58, skipping insertion in model container [2022-07-13 18:17:58,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:17:56" (2/3) ... [2022-07-13 18:17:58,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d6cb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:17:58, skipping insertion in model container [2022-07-13 18:17:58,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:17:58" (3/3) ... [2022-07-13 18:17:58,149 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-13 18:17:58,160 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:17:58,175 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:17:58,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:17:58,275 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7af74550, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c54cc83 [2022-07-13 18:17:58,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:17:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 18:17:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:17:58,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:58,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:58,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 255328600, now seen corresponding path program 1 times [2022-07-13 18:17:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:58,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651495023] [2022-07-13 18:17:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 18:17:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:17:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651495023] [2022-07-13 18:17:58,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651495023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:58,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:58,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 18:17:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527401941] [2022-07-13 18:17:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 18:17:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 18:17:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 18:17:58,670 INFO L87 Difference]: Start difference. First operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:58,753 INFO L93 Difference]: Finished difference Result 394 states and 634 transitions. [2022-07-13 18:17:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 18:17:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-13 18:17:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:58,765 INFO L225 Difference]: With dead ends: 394 [2022-07-13 18:17:58,766 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 18:17:58,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 18:17:58,774 INFO L413 NwaCegarLoop]: 308 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, 308 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 [2022-07-13 18:17:58,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:17:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 18:17:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-13 18:17:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 18:17:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2022-07-13 18:17:58,866 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 44 [2022-07-13 18:17:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:58,868 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2022-07-13 18:17:58,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2022-07-13 18:17:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:17:58,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:58,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:58,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:17:58,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:58,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:58,874 INFO L85 PathProgramCache]: Analyzing trace with hash 246563096, now seen corresponding path program 1 times [2022-07-13 18:17:58,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:58,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464815005] [2022-07-13 18:17:58,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:58,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 18:17:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:17:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:59,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464815005] [2022-07-13 18:17:59,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464815005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:59,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:59,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:17:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464674167] [2022-07-13 18:17:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:59,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:17:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:17:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:59,133 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:59,312 INFO L93 Difference]: Finished difference Result 525 states and 799 transitions. [2022-07-13 18:17:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:17:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-13 18:17:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:59,328 INFO L225 Difference]: With dead ends: 525 [2022-07-13 18:17:59,329 INFO L226 Difference]: Without dead ends: 338 [2022-07-13 18:17:59,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:17:59,337 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 167 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:59,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1564 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:17:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-13 18:17:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 201. [2022-07-13 18:17:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 162 states have internal predecessors, (230), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 18:17:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2022-07-13 18:17:59,392 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 44 [2022-07-13 18:17:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:59,392 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2022-07-13 18:17:59,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2022-07-13 18:17:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:17:59,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:59,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:17:59,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -428937283, now seen corresponding path program 1 times [2022-07-13 18:17:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:59,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223158435] [2022-07-13 18:17:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:17:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:17:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223158435] [2022-07-13 18:17:59,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223158435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:59,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:59,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:17:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198476252] [2022-07-13 18:17:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:59,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:17:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:17:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:17:59,587 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:59,632 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-07-13 18:17:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:17:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-13 18:17:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:59,635 INFO L225 Difference]: With dead ends: 389 [2022-07-13 18:17:59,635 INFO L226 Difference]: Without dead ends: 205 [2022-07-13 18:17:59,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:17:59,641 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 5 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:59,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 848 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:17:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-13 18:17:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-13 18:17:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 18:17:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2022-07-13 18:17:59,660 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 55 [2022-07-13 18:17:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:59,661 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2022-07-13 18:17:59,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:17:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2022-07-13 18:17:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:17:59,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:59,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:17:59,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 544058639, now seen corresponding path program 1 times [2022-07-13 18:17:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463792265] [2022-07-13 18:17:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:17:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:17:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 18:17:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:17:59,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463792265] [2022-07-13 18:17:59,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463792265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:59,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:59,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:17:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186684187] [2022-07-13 18:17:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:59,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:17:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:17:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:17:59,878 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:17:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:59,952 INFO L93 Difference]: Finished difference Result 558 states and 814 transitions. [2022-07-13 18:17:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:17:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-07-13 18:17:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:59,958 INFO L225 Difference]: With dead ends: 558 [2022-07-13 18:17:59,958 INFO L226 Difference]: Without dead ends: 370 [2022-07-13 18:17:59,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:17:59,963 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 223 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:59,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 614 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:17:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-13 18:18:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 360. [2022-07-13 18:18:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 283 states have (on average 1.431095406360424) internal successors, (405), 284 states have internal predecessors, (405), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-13 18:18:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 525 transitions. [2022-07-13 18:18:00,005 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 525 transitions. Word has length 71 [2022-07-13 18:18:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:00,006 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 525 transitions. [2022-07-13 18:18:00,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 525 transitions. [2022-07-13 18:18:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:18:00,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:00,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:00,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:18:00,025 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash -729077, now seen corresponding path program 1 times [2022-07-13 18:18:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:00,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372793372] [2022-07-13 18:18:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:18:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372793372] [2022-07-13 18:18:00,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372793372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:00,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:00,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951547003] [2022-07-13 18:18:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:00,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:00,130 INFO L87 Difference]: Start difference. First operand 360 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:00,195 INFO L93 Difference]: Finished difference Result 997 states and 1468 transitions. [2022-07-13 18:18:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-07-13 18:18:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:00,202 INFO L225 Difference]: With dead ends: 997 [2022-07-13 18:18:00,202 INFO L226 Difference]: Without dead ends: 654 [2022-07-13 18:18:00,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:00,204 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 231 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 649 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-07-13 18:18:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 637. [2022-07-13 18:18:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 488 states have (on average 1.4487704918032787) internal successors, (707), 491 states have internal predecessors, (707), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-07-13 18:18:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 941 transitions. [2022-07-13 18:18:00,298 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 941 transitions. Word has length 72 [2022-07-13 18:18:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:00,299 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 941 transitions. [2022-07-13 18:18:00,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 941 transitions. [2022-07-13 18:18:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:18:00,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:00,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:18:00,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1280592755, now seen corresponding path program 1 times [2022-07-13 18:18:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:00,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846160012] [2022-07-13 18:18:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:18:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846160012] [2022-07-13 18:18:00,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846160012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:00,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:00,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:18:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196192842] [2022-07-13 18:18:00,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:00,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:00,432 INFO L87 Difference]: Start difference. First operand 637 states and 941 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:00,906 INFO L93 Difference]: Finished difference Result 1785 states and 2683 transitions. [2022-07-13 18:18:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:18:00,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-07-13 18:18:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:00,914 INFO L225 Difference]: With dead ends: 1785 [2022-07-13 18:18:00,915 INFO L226 Difference]: Without dead ends: 1165 [2022-07-13 18:18:00,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:00,930 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 770 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:00,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 776 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:18:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-13 18:18:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2022-07-13 18:18:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4283333333333332) internal successors, (857), 603 states have internal predecessors, (857), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1105 transitions. [2022-07-13 18:18:01,026 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1105 transitions. Word has length 72 [2022-07-13 18:18:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:01,026 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1105 transitions. [2022-07-13 18:18:01,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1105 transitions. [2022-07-13 18:18:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 18:18:01,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:01,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:01,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:18:01,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 740165986, now seen corresponding path program 1 times [2022-07-13 18:18:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960862625] [2022-07-13 18:18:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:01,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:18:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:01,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960862625] [2022-07-13 18:18:01,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960862625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:01,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:01,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:18:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873455936] [2022-07-13 18:18:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:01,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:01,125 INFO L87 Difference]: Start difference. First operand 762 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:01,558 INFO L93 Difference]: Finished difference Result 1785 states and 2675 transitions. [2022-07-13 18:18:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:18:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2022-07-13 18:18:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:01,565 INFO L225 Difference]: With dead ends: 1785 [2022-07-13 18:18:01,565 INFO L226 Difference]: Without dead ends: 1165 [2022-07-13 18:18:01,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:01,584 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 766 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:01,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 779 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:18:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-13 18:18:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2022-07-13 18:18:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 603 states have internal predecessors, (853), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1101 transitions. [2022-07-13 18:18:01,673 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1101 transitions. Word has length 73 [2022-07-13 18:18:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:01,688 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1101 transitions. [2022-07-13 18:18:01,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:18:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1101 transitions. [2022-07-13 18:18:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 18:18:01,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:01,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:01,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:18:01,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2060570112, now seen corresponding path program 1 times [2022-07-13 18:18:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:01,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582704495] [2022-07-13 18:18:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:02,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582704495] [2022-07-13 18:18:02,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582704495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:02,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582387408] [2022-07-13 18:18:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:02,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:02,067 INFO L87 Difference]: Start difference. First operand 762 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 18:18:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:02,131 INFO L93 Difference]: Finished difference Result 1402 states and 2052 transitions. [2022-07-13 18:18:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:02,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2022-07-13 18:18:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:02,152 INFO L225 Difference]: With dead ends: 1402 [2022-07-13 18:18:02,152 INFO L226 Difference]: Without dead ends: 782 [2022-07-13 18:18:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:02,154 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 860 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 [2022-07-13 18:18:02,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 860 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-13 18:18:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2022-07-13 18:18:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 616 states have (on average 1.4107142857142858) internal successors, (869), 619 states have internal predecessors, (869), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1117 transitions. [2022-07-13 18:18:02,238 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1117 transitions. Word has length 74 [2022-07-13 18:18:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:02,238 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1117 transitions. [2022-07-13 18:18:02,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 18:18:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1117 transitions. [2022-07-13 18:18:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 18:18:02,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:02,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:02,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:18:02,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1071682645, now seen corresponding path program 1 times [2022-07-13 18:18:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:02,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983583126] [2022-07-13 18:18:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983583126] [2022-07-13 18:18:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983583126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:02,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:02,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:02,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052326089] [2022-07-13 18:18:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:02,380 INFO L87 Difference]: Start difference. First operand 782 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 18:18:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:02,518 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2022-07-13 18:18:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2022-07-13 18:18:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:02,522 INFO L225 Difference]: With dead ends: 1442 [2022-07-13 18:18:02,522 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 18:18:02,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:02,540 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:02,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 18:18:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-07-13 18:18:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 632 states have (on average 1.4003164556962024) internal successors, (885), 635 states have internal predecessors, (885), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1133 transitions. [2022-07-13 18:18:02,604 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1133 transitions. Word has length 82 [2022-07-13 18:18:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:02,604 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1133 transitions. [2022-07-13 18:18:02,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 18:18:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1133 transitions. [2022-07-13 18:18:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:18:02,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:02,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:02,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:18:02,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1920470825, now seen corresponding path program 1 times [2022-07-13 18:18:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:02,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044919119] [2022-07-13 18:18:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:02,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:02,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044919119] [2022-07-13 18:18:02,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044919119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:02,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:02,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16785750] [2022-07-13 18:18:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:02,733 INFO L87 Difference]: Start difference. First operand 802 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:18:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:02,836 INFO L93 Difference]: Finished difference Result 1482 states and 2128 transitions. [2022-07-13 18:18:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2022-07-13 18:18:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:02,840 INFO L225 Difference]: With dead ends: 1482 [2022-07-13 18:18:02,840 INFO L226 Difference]: Without dead ends: 822 [2022-07-13 18:18:02,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:02,842 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:02,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-07-13 18:18:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-07-13 18:18:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 648 states have (on average 1.3904320987654322) internal successors, (901), 651 states have internal predecessors, (901), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1149 transitions. [2022-07-13 18:18:02,934 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1149 transitions. Word has length 90 [2022-07-13 18:18:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:02,935 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1149 transitions. [2022-07-13 18:18:02,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:18:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1149 transitions. [2022-07-13 18:18:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:18:02,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:02,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:02,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:18:02,953 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -21962832, now seen corresponding path program 1 times [2022-07-13 18:18:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:02,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754635365] [2022-07-13 18:18:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:18:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754635365] [2022-07-13 18:18:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754635365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:03,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:03,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470360787] [2022-07-13 18:18:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:03,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:03,060 INFO L87 Difference]: Start difference. First operand 822 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:18:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:03,123 INFO L93 Difference]: Finished difference Result 1518 states and 2144 transitions. [2022-07-13 18:18:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2022-07-13 18:18:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:03,127 INFO L225 Difference]: With dead ends: 1518 [2022-07-13 18:18:03,127 INFO L226 Difference]: Without dead ends: 838 [2022-07-13 18:18:03,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:03,129 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:03,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-07-13 18:18:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2022-07-13 18:18:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 660 states have (on average 1.3833333333333333) internal successors, (913), 663 states have internal predecessors, (913), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1161 transitions. [2022-07-13 18:18:03,164 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1161 transitions. Word has length 90 [2022-07-13 18:18:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:03,164 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1161 transitions. [2022-07-13 18:18:03,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:18:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1161 transitions. [2022-07-13 18:18:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 18:18:03,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:03,166 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:03,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 18:18:03,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1155165143, now seen corresponding path program 1 times [2022-07-13 18:18:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:03,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719881664] [2022-07-13 18:18:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:18:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:03,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719881664] [2022-07-13 18:18:03,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719881664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:03,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:03,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587606199] [2022-07-13 18:18:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:03,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:03,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:03,309 INFO L87 Difference]: Start difference. First operand 838 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 18:18:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:03,394 INFO L93 Difference]: Finished difference Result 1558 states and 2180 transitions. [2022-07-13 18:18:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2022-07-13 18:18:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:03,412 INFO L225 Difference]: With dead ends: 1558 [2022-07-13 18:18:03,413 INFO L226 Difference]: Without dead ends: 862 [2022-07-13 18:18:03,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:03,416 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 7 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:03,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-07-13 18:18:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-07-13 18:18:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 680 states have (on average 1.3720588235294118) internal successors, (933), 683 states have internal predecessors, (933), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-13 18:18:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1181 transitions. [2022-07-13 18:18:03,492 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1181 transitions. Word has length 98 [2022-07-13 18:18:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:03,493 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1181 transitions. [2022-07-13 18:18:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 18:18:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1181 transitions. [2022-07-13 18:18:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 18:18:03,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:03,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:03,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 18:18:03,496 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1039496388, now seen corresponding path program 1 times [2022-07-13 18:18:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315767927] [2022-07-13 18:18:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:18:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315767927] [2022-07-13 18:18:03,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315767927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:03,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:03,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671043540] [2022-07-13 18:18:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:03,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:03,750 INFO L87 Difference]: Start difference. First operand 862 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:18:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:04,139 INFO L93 Difference]: Finished difference Result 2467 states and 3431 transitions. [2022-07-13 18:18:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 101 [2022-07-13 18:18:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:04,148 INFO L225 Difference]: With dead ends: 2467 [2022-07-13 18:18:04,148 INFO L226 Difference]: Without dead ends: 1747 [2022-07-13 18:18:04,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:18:04,151 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 391 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2260 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-07-13 18:18:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1146. [2022-07-13 18:18:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 891 states have (on average 1.3636363636363635) internal successors, (1215), 896 states have internal predecessors, (1215), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-13 18:18:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1559 transitions. [2022-07-13 18:18:04,287 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1559 transitions. Word has length 101 [2022-07-13 18:18:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:04,288 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1559 transitions. [2022-07-13 18:18:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:18:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1559 transitions. [2022-07-13 18:18:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 18:18:04,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:04,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:04,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 18:18:04,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -410105680, now seen corresponding path program 1 times [2022-07-13 18:18:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:04,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381098090] [2022-07-13 18:18:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:18:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:04,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381098090] [2022-07-13 18:18:04,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381098090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:04,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:04,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:18:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705934999] [2022-07-13 18:18:04,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:18:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:18:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:18:04,491 INFO L87 Difference]: Start difference. First operand 1146 states and 1559 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:18:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:04,794 INFO L93 Difference]: Finished difference Result 1611 states and 2289 transitions. [2022-07-13 18:18:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:18:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 104 [2022-07-13 18:18:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:04,801 INFO L225 Difference]: With dead ends: 1611 [2022-07-13 18:18:04,801 INFO L226 Difference]: Without dead ends: 1609 [2022-07-13 18:18:04,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:04,802 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 255 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:04,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2227 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-07-13 18:18:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1154. [2022-07-13 18:18:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 895 states have (on average 1.3620111731843576) internal successors, (1219), 902 states have internal predecessors, (1219), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-13 18:18:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1567 transitions. [2022-07-13 18:18:04,957 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1567 transitions. Word has length 104 [2022-07-13 18:18:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:04,957 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1567 transitions. [2022-07-13 18:18:04,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:18:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1567 transitions. [2022-07-13 18:18:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 18:18:04,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:04,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:04,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:18:04,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1945149666, now seen corresponding path program 1 times [2022-07-13 18:18:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:04,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289804104] [2022-07-13 18:18:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 18:18:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:18:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:05,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289804104] [2022-07-13 18:18:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289804104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:05,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:05,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88161410] [2022-07-13 18:18:05,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:05,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:05,047 INFO L87 Difference]: Start difference. First operand 1154 states and 1567 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:18:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:05,109 INFO L93 Difference]: Finished difference Result 2122 states and 2904 transitions. [2022-07-13 18:18:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:05,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 105 [2022-07-13 18:18:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:05,114 INFO L225 Difference]: With dead ends: 2122 [2022-07-13 18:18:05,114 INFO L226 Difference]: Without dead ends: 1178 [2022-07-13 18:18:05,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:05,118 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:05,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-07-13 18:18:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2022-07-13 18:18:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 913 states have (on average 1.3548740416210296) internal successors, (1237), 920 states have internal predecessors, (1237), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-13 18:18:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1585 transitions. [2022-07-13 18:18:05,231 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1585 transitions. Word has length 105 [2022-07-13 18:18:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:05,231 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1585 transitions. [2022-07-13 18:18:05,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:18:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1585 transitions. [2022-07-13 18:18:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 18:18:05,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:05,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:05,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:18:05,234 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1810984556, now seen corresponding path program 1 times [2022-07-13 18:18:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702690897] [2022-07-13 18:18:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:18:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:05,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702690897] [2022-07-13 18:18:05,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702690897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:05,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:05,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934444525] [2022-07-13 18:18:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:05,391 INFO L87 Difference]: Start difference. First operand 1178 states and 1585 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:18:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:05,661 INFO L93 Difference]: Finished difference Result 2408 states and 3282 transitions. [2022-07-13 18:18:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:05,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-07-13 18:18:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:05,667 INFO L225 Difference]: With dead ends: 2408 [2022-07-13 18:18:05,667 INFO L226 Difference]: Without dead ends: 1522 [2022-07-13 18:18:05,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:18:05,681 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 513 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:05,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2231 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-07-13 18:18:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1224. [2022-07-13 18:18:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 970 states have (on average 1.3443298969072166) internal successors, (1304), 982 states have internal predecessors, (1304), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-07-13 18:18:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1628 transitions. [2022-07-13 18:18:05,832 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1628 transitions. Word has length 107 [2022-07-13 18:18:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:05,832 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1628 transitions. [2022-07-13 18:18:05,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:18:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1628 transitions. [2022-07-13 18:18:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 18:18:05,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:05,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:05,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:18:05,834 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 687723298, now seen corresponding path program 1 times [2022-07-13 18:18:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380741349] [2022-07-13 18:18:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:18:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:18:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:06,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380741349] [2022-07-13 18:18:06,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380741349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:06,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:06,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840742673] [2022-07-13 18:18:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:06,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:06,012 INFO L87 Difference]: Start difference. First operand 1224 states and 1628 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:18:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:06,314 INFO L93 Difference]: Finished difference Result 2518 states and 3425 transitions. [2022-07-13 18:18:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 109 [2022-07-13 18:18:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:06,321 INFO L225 Difference]: With dead ends: 2518 [2022-07-13 18:18:06,335 INFO L226 Difference]: Without dead ends: 1566 [2022-07-13 18:18:06,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:18:06,339 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 395 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:06,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2381 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-07-13 18:18:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1110. [2022-07-13 18:18:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 883 states have (on average 1.345413363533409) internal successors, (1188), 893 states have internal predecessors, (1188), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-07-13 18:18:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1478 transitions. [2022-07-13 18:18:06,473 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1478 transitions. Word has length 109 [2022-07-13 18:18:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:06,473 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1478 transitions. [2022-07-13 18:18:06,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:18:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1478 transitions. [2022-07-13 18:18:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 18:18:06,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:06,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:06,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 18:18:06,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash 943897966, now seen corresponding path program 1 times [2022-07-13 18:18:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:06,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368517085] [2022-07-13 18:18:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 18:18:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:18:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 18:18:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:06,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368517085] [2022-07-13 18:18:06,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368517085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:06,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:06,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:18:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775694566] [2022-07-13 18:18:06,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:06,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:18:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:18:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:06,670 INFO L87 Difference]: Start difference. First operand 1110 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 18:18:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:07,405 INFO L93 Difference]: Finished difference Result 2589 states and 3532 transitions. [2022-07-13 18:18:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:18:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 110 [2022-07-13 18:18:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:07,411 INFO L225 Difference]: With dead ends: 2589 [2022-07-13 18:18:07,412 INFO L226 Difference]: Without dead ends: 1671 [2022-07-13 18:18:07,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:07,414 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1030 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:07,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2129 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:18:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-13 18:18:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1126. [2022-07-13 18:18:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 891 states have (on average 1.3254769921436589) internal successors, (1181), 902 states have internal predecessors, (1181), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-07-13 18:18:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1477 transitions. [2022-07-13 18:18:07,524 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1477 transitions. Word has length 110 [2022-07-13 18:18:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:07,524 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1477 transitions. [2022-07-13 18:18:07,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 18:18:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1477 transitions. [2022-07-13 18:18:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 18:18:07,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:07,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 18:18:07,526 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 272075901, now seen corresponding path program 1 times [2022-07-13 18:18:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:07,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740909146] [2022-07-13 18:18:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 18:18:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:18:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740909146] [2022-07-13 18:18:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740909146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:07,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:07,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009136374] [2022-07-13 18:18:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:07,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:07,649 INFO L87 Difference]: Start difference. First operand 1126 states and 1477 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:07,932 INFO L93 Difference]: Finished difference Result 3155 states and 4223 transitions. [2022-07-13 18:18:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2022-07-13 18:18:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:07,954 INFO L225 Difference]: With dead ends: 3155 [2022-07-13 18:18:07,954 INFO L226 Difference]: Without dead ends: 2272 [2022-07-13 18:18:07,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:07,965 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 434 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:07,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1211 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2022-07-13 18:18:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1915. [2022-07-13 18:18:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1490 states have (on average 1.323489932885906) internal successors, (1972), 1509 states have internal predecessors, (1972), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-07-13 18:18:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2516 transitions. [2022-07-13 18:18:08,200 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2516 transitions. Word has length 110 [2022-07-13 18:18:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:08,200 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 2516 transitions. [2022-07-13 18:18:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2516 transitions. [2022-07-13 18:18:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 18:18:08,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:08,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:08,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 18:18:08,208 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:08,209 INFO L85 PathProgramCache]: Analyzing trace with hash 173907826, now seen corresponding path program 1 times [2022-07-13 18:18:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:08,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309829558] [2022-07-13 18:18:08,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:08,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 18:18:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:18:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 18:18:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:08,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309829558] [2022-07-13 18:18:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309829558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:08,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:08,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590999566] [2022-07-13 18:18:08,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:08,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:08,361 INFO L87 Difference]: Start difference. First operand 1915 states and 2516 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:09,656 INFO L93 Difference]: Finished difference Result 4352 states and 5848 transitions. [2022-07-13 18:18:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:18:09,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-07-13 18:18:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:09,667 INFO L225 Difference]: With dead ends: 4352 [2022-07-13 18:18:09,667 INFO L226 Difference]: Without dead ends: 2774 [2022-07-13 18:18:09,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:09,671 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 788 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:09,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2482 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 18:18:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-07-13 18:18:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1936. [2022-07-13 18:18:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1498 states have (on average 1.3190921228304406) internal successors, (1976), 1518 states have internal predecessors, (1976), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-07-13 18:18:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2536 transitions. [2022-07-13 18:18:09,928 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2536 transitions. Word has length 112 [2022-07-13 18:18:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:09,928 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2536 transitions. [2022-07-13 18:18:09,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2536 transitions. [2022-07-13 18:18:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 18:18:09,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:09,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:09,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 18:18:09,941 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 540191593, now seen corresponding path program 1 times [2022-07-13 18:18:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:09,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139465943] [2022-07-13 18:18:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:18:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:18:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:10,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139465943] [2022-07-13 18:18:10,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139465943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:10,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:10,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775778226] [2022-07-13 18:18:10,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:10,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:10,135 INFO L87 Difference]: Start difference. First operand 1936 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:10,602 INFO L93 Difference]: Finished difference Result 5122 states and 6787 transitions. [2022-07-13 18:18:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-07-13 18:18:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:10,636 INFO L225 Difference]: With dead ends: 5122 [2022-07-13 18:18:10,651 INFO L226 Difference]: Without dead ends: 3560 [2022-07-13 18:18:10,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:10,657 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 481 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:10,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1275 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2022-07-13 18:18:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2987. [2022-07-13 18:18:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2274 states have (on average 1.3153034300791557) internal successors, (2991), 2305 states have internal predecessors, (2991), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-07-13 18:18:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3911 transitions. [2022-07-13 18:18:11,005 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3911 transitions. Word has length 113 [2022-07-13 18:18:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:11,006 INFO L495 AbstractCegarLoop]: Abstraction has 2987 states and 3911 transitions. [2022-07-13 18:18:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3911 transitions. [2022-07-13 18:18:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 18:18:11,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:11,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:11,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 18:18:11,024 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -290051495, now seen corresponding path program 1 times [2022-07-13 18:18:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:11,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363615139] [2022-07-13 18:18:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:18:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:18:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363615139] [2022-07-13 18:18:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363615139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:11,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884639868] [2022-07-13 18:18:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:11,128 INFO L87 Difference]: Start difference. First operand 2987 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:11,895 INFO L93 Difference]: Finished difference Result 7078 states and 9333 transitions. [2022-07-13 18:18:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-07-13 18:18:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:11,910 INFO L225 Difference]: With dead ends: 7078 [2022-07-13 18:18:11,923 INFO L226 Difference]: Without dead ends: 4591 [2022-07-13 18:18:11,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:11,931 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 428 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:11,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1272 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:18:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-07-13 18:18:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4255. [2022-07-13 18:18:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 3218 states have (on average 1.3132380360472342) internal successors, (4226), 3262 states have internal predecessors, (4226), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-07-13 18:18:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5570 transitions. [2022-07-13 18:18:12,604 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5570 transitions. Word has length 113 [2022-07-13 18:18:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:12,605 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 5570 transitions. [2022-07-13 18:18:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5570 transitions. [2022-07-13 18:18:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 18:18:12,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:12,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:12,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 18:18:12,608 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 725293879, now seen corresponding path program 1 times [2022-07-13 18:18:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:12,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071208540] [2022-07-13 18:18:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:18:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:18:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:18:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:18:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:12,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071208540] [2022-07-13 18:18:12,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071208540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:12,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:12,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:12,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183842576] [2022-07-13 18:18:12,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:12,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:12,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:12,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:12,677 INFO L87 Difference]: Start difference. First operand 4255 states and 5570 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:13,391 INFO L93 Difference]: Finished difference Result 9626 states and 13040 transitions. [2022-07-13 18:18:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-07-13 18:18:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:13,407 INFO L225 Difference]: With dead ends: 9626 [2022-07-13 18:18:13,407 INFO L226 Difference]: Without dead ends: 5764 [2022-07-13 18:18:13,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:13,417 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:13,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 696 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2022-07-13 18:18:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4261. [2022-07-13 18:18:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3224 states have (on average 1.3126550868486353) internal successors, (4232), 3268 states have internal predecessors, (4232), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-07-13 18:18:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5576 transitions. [2022-07-13 18:18:14,186 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5576 transitions. Word has length 114 [2022-07-13 18:18:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:14,200 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 5576 transitions. [2022-07-13 18:18:14,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5576 transitions. [2022-07-13 18:18:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 18:18:14,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:14,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:14,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 18:18:14,203 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1766585516, now seen corresponding path program 1 times [2022-07-13 18:18:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:14,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719990031] [2022-07-13 18:18:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:18:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:18:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:14,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719990031] [2022-07-13 18:18:14,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719990031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:14,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:14,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783100245] [2022-07-13 18:18:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:14,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:14,448 INFO L87 Difference]: Start difference. First operand 4261 states and 5576 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:15,083 INFO L93 Difference]: Finished difference Result 8938 states and 11948 transitions. [2022-07-13 18:18:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-07-13 18:18:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:15,098 INFO L225 Difference]: With dead ends: 8938 [2022-07-13 18:18:15,115 INFO L226 Difference]: Without dead ends: 4770 [2022-07-13 18:18:15,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:15,148 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 356 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:15,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 870 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-07-13 18:18:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3836. [2022-07-13 18:18:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 2882 states have (on average 1.3178348369188064) internal successors, (3798), 2916 states have internal predecessors, (3798), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-13 18:18:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5038 transitions. [2022-07-13 18:18:15,781 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5038 transitions. Word has length 115 [2022-07-13 18:18:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:15,781 INFO L495 AbstractCegarLoop]: Abstraction has 3836 states and 5038 transitions. [2022-07-13 18:18:15,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5038 transitions. [2022-07-13 18:18:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 18:18:15,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:15,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 18:18:15,783 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -723784830, now seen corresponding path program 1 times [2022-07-13 18:18:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473085784] [2022-07-13 18:18:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:18:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:18:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:18:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:18:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473085784] [2022-07-13 18:18:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473085784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:15,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224813369] [2022-07-13 18:18:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:15,864 INFO L87 Difference]: Start difference. First operand 3836 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:16,582 INFO L93 Difference]: Finished difference Result 8444 states and 11382 transitions. [2022-07-13 18:18:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-07-13 18:18:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:16,609 INFO L225 Difference]: With dead ends: 8444 [2022-07-13 18:18:16,615 INFO L226 Difference]: Without dead ends: 4815 [2022-07-13 18:18:16,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:16,692 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 148 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:16,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 674 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2022-07-13 18:18:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3846. [2022-07-13 18:18:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 2892 states have (on average 1.3167358229598893) internal successors, (3808), 2926 states have internal predecessors, (3808), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-13 18:18:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5048 transitions. [2022-07-13 18:18:17,029 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5048 transitions. Word has length 116 [2022-07-13 18:18:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:17,030 INFO L495 AbstractCegarLoop]: Abstraction has 3846 states and 5048 transitions. [2022-07-13 18:18:17,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5048 transitions. [2022-07-13 18:18:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 18:18:17,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:17,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:17,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 18:18:17,035 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash -440834179, now seen corresponding path program 1 times [2022-07-13 18:18:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:17,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811023215] [2022-07-13 18:18:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:18:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:18:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:18:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:18:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:18:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:17,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811023215] [2022-07-13 18:18:17,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811023215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:17,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:17,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060264461] [2022-07-13 18:18:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:17,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:17,141 INFO L87 Difference]: Start difference. First operand 3846 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:17,979 INFO L93 Difference]: Finished difference Result 8395 states and 11302 transitions. [2022-07-13 18:18:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-07-13 18:18:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:17,993 INFO L225 Difference]: With dead ends: 8395 [2022-07-13 18:18:17,993 INFO L226 Difference]: Without dead ends: 4691 [2022-07-13 18:18:18,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:18,002 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 271 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:18,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 901 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-07-13 18:18:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 2895. [2022-07-13 18:18:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2175 states have (on average 1.3066666666666666) internal successors, (2842), 2194 states have internal predecessors, (2842), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-07-13 18:18:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3780 transitions. [2022-07-13 18:18:18,649 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3780 transitions. Word has length 116 [2022-07-13 18:18:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:18,663 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 3780 transitions. [2022-07-13 18:18:18,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:18:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3780 transitions. [2022-07-13 18:18:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 18:18:18,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:18,677 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:18,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 18:18:18,677 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1943845531, now seen corresponding path program 1 times [2022-07-13 18:18:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913599645] [2022-07-13 18:18:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 18:18:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 18:18:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 18:18:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 18:18:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 18:18:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 18:18:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 18:18:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:18,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913599645] [2022-07-13 18:18:18,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913599645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:18,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342533556] [2022-07-13 18:18:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:18,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:18:18,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:18:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:18:19,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 18:18:19,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 18:18:19,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342533556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:19,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:19,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-13 18:18:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569181535] [2022-07-13 18:18:19,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:19,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 18:18:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 18:18:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:18:19,726 INFO L87 Difference]: Start difference. First operand 2895 states and 3780 transitions. Second operand has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-13 18:18:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:24,649 INFO L93 Difference]: Finished difference Result 9922 states and 13848 transitions. [2022-07-13 18:18:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 18:18:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2022-07-13 18:18:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:24,686 INFO L225 Difference]: With dead ends: 9922 [2022-07-13 18:18:24,687 INFO L226 Difference]: Without dead ends: 7306 [2022-07-13 18:18:24,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-07-13 18:18:24,711 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 4409 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:24,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 3258 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 18:18:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-07-13 18:18:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 3419. [2022-07-13 18:18:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 2592 states have (on average 1.3036265432098766) internal successors, (3379), 2612 states have internal predecessors, (3379), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2022-07-13 18:18:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4441 transitions. [2022-07-13 18:18:25,286 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 4441 transitions. Word has length 184 [2022-07-13 18:18:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:25,287 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 4441 transitions. [2022-07-13 18:18:25,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-13 18:18:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 4441 transitions. [2022-07-13 18:18:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-13 18:18:25,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:25,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:25,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:18:25,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 18:18:25,509 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1757506182, now seen corresponding path program 1 times [2022-07-13 18:18:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950660687] [2022-07-13 18:18:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 18:18:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:18:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 18:18:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:18:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 18:18:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 18:18:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 18:18:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 18:18:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 18:18:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 18:18:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:18:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-13 18:18:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950660687] [2022-07-13 18:18:25,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950660687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356480588] [2022-07-13 18:18:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:25,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:25,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:18:25,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:18:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 18:18:25,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:18:26,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 18:18:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356480588] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:26,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-13 18:18:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972113638] [2022-07-13 18:18:26,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 18:18:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 18:18:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:18:26,569 INFO L87 Difference]: Start difference. First operand 3419 states and 4441 transitions. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-13 18:18:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:35,620 INFO L93 Difference]: Finished difference Result 17212 states and 23325 transitions. [2022-07-13 18:18:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-13 18:18:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 192 [2022-07-13 18:18:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:35,668 INFO L225 Difference]: With dead ends: 17212 [2022-07-13 18:18:35,669 INFO L226 Difference]: Without dead ends: 14081 [2022-07-13 18:18:35,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-07-13 18:18:35,681 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 5757 mSDsluCounter, 13477 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5757 SdHoareTripleChecker+Valid, 15265 SdHoareTripleChecker+Invalid, 8993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3537 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:35,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5757 Valid, 15265 Invalid, 8993 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3537 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 18:18:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states. [2022-07-13 18:18:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 6242. [2022-07-13 18:18:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 4698 states have (on average 1.3018305661983822) internal successors, (6116), 4736 states have internal predecessors, (6116), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2022-07-13 18:18:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 8100 transitions. [2022-07-13 18:18:36,710 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 8100 transitions. Word has length 192 [2022-07-13 18:18:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:36,710 INFO L495 AbstractCegarLoop]: Abstraction has 6242 states and 8100 transitions. [2022-07-13 18:18:36,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-13 18:18:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 8100 transitions. [2022-07-13 18:18:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 18:18:36,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:36,736 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:36,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:18:36,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 18:18:36,940 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2073750461, now seen corresponding path program 1 times [2022-07-13 18:18:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:36,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014971578] [2022-07-13 18:18:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 18:18:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 18:18:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 18:18:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 18:18:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 18:18:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:18:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 18:18:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 18:18:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:37,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014971578] [2022-07-13 18:18:37,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014971578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:37,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:37,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574092812] [2022-07-13 18:18:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:37,080 INFO L87 Difference]: Start difference. First operand 6242 states and 8100 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 18:18:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:39,091 INFO L93 Difference]: Finished difference Result 20990 states and 27898 transitions. [2022-07-13 18:18:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:18:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 194 [2022-07-13 18:18:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:39,169 INFO L225 Difference]: With dead ends: 20990 [2022-07-13 18:18:39,170 INFO L226 Difference]: Without dead ends: 15098 [2022-07-13 18:18:39,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:39,202 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 801 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:39,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 3048 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:18:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2022-07-13 18:18:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 8084. [2022-07-13 18:18:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8084 states, 6028 states have (on average 1.3012607830126077) internal successors, (7844), 6079 states have internal predecessors, (7844), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2022-07-13 18:18:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8084 states to 8084 states and 10514 transitions. [2022-07-13 18:18:40,341 INFO L78 Accepts]: Start accepts. Automaton has 8084 states and 10514 transitions. Word has length 194 [2022-07-13 18:18:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:40,342 INFO L495 AbstractCegarLoop]: Abstraction has 8084 states and 10514 transitions. [2022-07-13 18:18:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 18:18:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8084 states and 10514 transitions. [2022-07-13 18:18:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-13 18:18:40,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:40,376 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:40,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 18:18:40,376 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1452894841, now seen corresponding path program 1 times [2022-07-13 18:18:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:40,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014588030] [2022-07-13 18:18:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 18:18:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 18:18:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 18:18:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 18:18:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 18:18:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:18:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 18:18:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 18:18:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:40,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014588030] [2022-07-13 18:18:40,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014588030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:40,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510413737] [2022-07-13 18:18:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:40,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:40,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:18:40,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:18:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:40,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:18:40,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-13 18:18:40,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 18:18:40,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510413737] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:40,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:18:40,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2022-07-13 18:18:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090175941] [2022-07-13 18:18:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:40,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:40,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:40,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:40,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:40,900 INFO L87 Difference]: Start difference. First operand 8084 states and 10514 transitions. Second operand has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 18:18:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:41,573 INFO L93 Difference]: Finished difference Result 13320 states and 17375 transitions. [2022-07-13 18:18:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 195 [2022-07-13 18:18:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:41,591 INFO L225 Difference]: With dead ends: 13320 [2022-07-13 18:18:41,591 INFO L226 Difference]: Without dead ends: 5440 [2022-07-13 18:18:41,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:41,603 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:41,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 858 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2022-07-13 18:18:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2022-07-13 18:18:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4058 states have (on average 1.3013799901429275) internal successors, (5281), 4092 states have internal predecessors, (5281), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-07-13 18:18:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7083 transitions. [2022-07-13 18:18:42,208 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7083 transitions. Word has length 195 [2022-07-13 18:18:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:42,211 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 7083 transitions. [2022-07-13 18:18:42,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 18:18:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7083 transitions. [2022-07-13 18:18:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-13 18:18:42,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:42,221 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:42,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:18:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:42,435 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1119904118, now seen corresponding path program 1 times [2022-07-13 18:18:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:42,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753745890] [2022-07-13 18:18:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 18:18:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 18:18:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 18:18:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 18:18:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 18:18:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:18:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 18:18:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:18:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:42,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753745890] [2022-07-13 18:18:42,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753745890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:42,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193482861] [2022-07-13 18:18:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:42,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:42,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:18:42,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:18:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 18:18:42,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 18:18:42,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 18:18:42,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193482861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:42,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:42,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-13 18:18:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022105233] [2022-07-13 18:18:42,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:42,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 18:18:42,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 18:18:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:18:42,976 INFO L87 Difference]: Start difference. First operand 5440 states and 7083 transitions. Second operand has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-13 18:18:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:47,131 INFO L93 Difference]: Finished difference Result 15340 states and 20999 transitions. [2022-07-13 18:18:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-13 18:18:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 195 [2022-07-13 18:18:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:47,196 INFO L225 Difference]: With dead ends: 15340 [2022-07-13 18:18:47,210 INFO L226 Difference]: Without dead ends: 10105 [2022-07-13 18:18:47,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 18:18:47,235 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 3192 mSDsluCounter, 5425 mSDsCounter, 0 mSdLazyCounter, 3848 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3192 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 3848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:47,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3192 Valid, 5987 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 3848 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 18:18:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10105 states. [2022-07-13 18:18:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10105 to 6038. [2022-07-13 18:18:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 4502 states have (on average 1.2972012438916036) internal successors, (5840), 4540 states have internal predecessors, (5840), 998 states have call successors, (998), 537 states have call predecessors, (998), 537 states have return successors, (998), 960 states have call predecessors, (998), 998 states have call successors, (998) [2022-07-13 18:18:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 7836 transitions. [2022-07-13 18:18:48,161 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 7836 transitions. Word has length 195 [2022-07-13 18:18:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:48,161 INFO L495 AbstractCegarLoop]: Abstraction has 6038 states and 7836 transitions. [2022-07-13 18:18:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-13 18:18:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 7836 transitions. [2022-07-13 18:18:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-13 18:18:48,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:48,168 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:48,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:18:48,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:48,383 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1845710140, now seen corresponding path program 1 times [2022-07-13 18:18:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:48,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099432957] [2022-07-13 18:18:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 18:18:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 18:18:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 18:18:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 18:18:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 18:18:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:18:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 18:18:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 18:18:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-13 18:18:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099432957] [2022-07-13 18:18:48,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099432957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:48,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:48,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:18:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495687074] [2022-07-13 18:18:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:48,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:48,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:48,473 INFO L87 Difference]: Start difference. First operand 6038 states and 7836 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 18:18:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:49,125 INFO L93 Difference]: Finished difference Result 11521 states and 15006 transitions. [2022-07-13 18:18:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 203 [2022-07-13 18:18:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:49,141 INFO L225 Difference]: With dead ends: 11521 [2022-07-13 18:18:49,141 INFO L226 Difference]: Without dead ends: 5677 [2022-07-13 18:18:49,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:49,150 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:49,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 438 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2022-07-13 18:18:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5677. [2022-07-13 18:18:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 4235 states have (on average 1.298229043683589) internal successors, (5498), 4271 states have internal predecessors, (5498), 938 states have call successors, (938), 503 states have call predecessors, (938), 503 states have return successors, (938), 902 states have call predecessors, (938), 938 states have call successors, (938) [2022-07-13 18:18:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 7374 transitions. [2022-07-13 18:18:49,809 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 7374 transitions. Word has length 203 [2022-07-13 18:18:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:49,809 INFO L495 AbstractCegarLoop]: Abstraction has 5677 states and 7374 transitions. [2022-07-13 18:18:49,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 18:18:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 7374 transitions. [2022-07-13 18:18:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-13 18:18:49,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:49,818 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:49,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 18:18:49,818 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1739070418, now seen corresponding path program 1 times [2022-07-13 18:18:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:49,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900088594] [2022-07-13 18:18:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 18:18:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 18:18:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 18:18:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 18:18:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 18:18:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 18:18:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 18:18:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-13 18:18:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 18:18:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:49,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900088594] [2022-07-13 18:18:49,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900088594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:49,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979929753] [2022-07-13 18:18:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:49,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:18:49,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:18:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:50,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:18:50,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 18:18:50,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 18:18:50,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979929753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:50,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:50,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-13 18:18:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436427579] [2022-07-13 18:18:50,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:50,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 18:18:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 18:18:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:18:50,393 INFO L87 Difference]: Start difference. First operand 5677 states and 7374 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-07-13 18:18:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:56,118 INFO L93 Difference]: Finished difference Result 16844 states and 23130 transitions. [2022-07-13 18:18:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-13 18:18:56,119 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 204 [2022-07-13 18:18:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:56,152 INFO L225 Difference]: With dead ends: 16844 [2022-07-13 18:18:56,153 INFO L226 Difference]: Without dead ends: 11372 [2022-07-13 18:18:56,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-13 18:18:56,165 INFO L413 NwaCegarLoop]: 631 mSDtfsCounter, 2973 mSDsluCounter, 6247 mSDsCounter, 0 mSdLazyCounter, 5201 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2973 SdHoareTripleChecker+Valid, 6878 SdHoareTripleChecker+Invalid, 6662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 5201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:56,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2973 Valid, 6878 Invalid, 6662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 5201 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 18:18:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2022-07-13 18:18:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 6321. [2022-07-13 18:18:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 4723 states have (on average 1.2945161973322041) internal successors, (6114), 4763 states have internal predecessors, (6114), 1036 states have call successors, (1036), 561 states have call predecessors, (1036), 561 states have return successors, (1036), 996 states have call predecessors, (1036), 1036 states have call successors, (1036) [2022-07-13 18:18:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 8186 transitions. [2022-07-13 18:18:57,007 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 8186 transitions. Word has length 204 [2022-07-13 18:18:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:57,008 INFO L495 AbstractCegarLoop]: Abstraction has 6321 states and 8186 transitions. [2022-07-13 18:18:57,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-07-13 18:18:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 8186 transitions. [2022-07-13 18:18:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-13 18:18:57,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:57,015 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:57,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:18:57,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-13 18:18:57,231 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2074523146, now seen corresponding path program 1 times [2022-07-13 18:18:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:57,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688524867] [2022-07-13 18:18:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:18:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:18:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:18:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:18:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:18:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 18:18:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 18:18:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 18:18:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 18:18:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:18:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 18:18:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 18:18:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 18:18:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-13 18:18:57,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:57,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688524867] [2022-07-13 18:18:57,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688524867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:57,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:57,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663018611] [2022-07-13 18:18:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:57,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:57,285 INFO L87 Difference]: Start difference. First operand 6321 states and 8186 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 18:18:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:58,005 INFO L93 Difference]: Finished difference Result 11879 states and 15447 transitions. [2022-07-13 18:18:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 211 [2022-07-13 18:18:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:58,016 INFO L225 Difference]: With dead ends: 11879 [2022-07-13 18:18:58,016 INFO L226 Difference]: Without dead ends: 5754 [2022-07-13 18:18:58,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:58,022 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 233 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:58,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 484 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2022-07-13 18:18:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5746. [2022-07-13 18:18:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 4302 states have (on average 1.294746629474663) internal successors, (5570), 4338 states have internal predecessors, (5570), 939 states have call successors, (939), 504 states have call predecessors, (939), 504 states have return successors, (939), 903 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-13 18:18:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 7448 transitions. [2022-07-13 18:18:58,670 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 7448 transitions. Word has length 211 [2022-07-13 18:18:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:58,671 INFO L495 AbstractCegarLoop]: Abstraction has 5746 states and 7448 transitions. [2022-07-13 18:18:58,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 18:18:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 7448 transitions. [2022-07-13 18:18:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-13 18:18:58,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:58,677 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:58,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 18:18:58,678 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:58,678 INFO L85 PathProgramCache]: Analyzing trace with hash 13361221, now seen corresponding path program 1 times [2022-07-13 18:18:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:58,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67365002] [2022-07-13 18:18:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:18:58,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:18:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:18:58,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:18:58,816 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:18:58,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:18:58,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 18:18:58,820 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:18:58,823 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:18:58,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:18:58 BoogieIcfgContainer [2022-07-13 18:18:58,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:18:58,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:18:58,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:18:58,984 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:18:58,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:17:58" (3/4) ... [2022-07-13 18:18:58,985 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:18:59,132 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:18:59,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:18:59,133 INFO L158 Benchmark]: Toolchain (without parser) took 62755.23ms. Allocated memory was 86.0MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 63.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 934.1MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,133 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:18:59,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.30ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 53.3MB in the end (delta: 10.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.01ms. Allocated memory is still 86.0MB. Free memory was 53.3MB in the beginning and 50.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,134 INFO L158 Benchmark]: Boogie Preprocessor took 70.29ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,134 INFO L158 Benchmark]: RCFGBuilder took 1025.89ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 69.6MB in the end (delta: -21.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,134 INFO L158 Benchmark]: TraceAbstraction took 60852.18ms. Allocated memory was 104.9MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 69.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 887.2MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,134 INFO L158 Benchmark]: Witness Printer took 149.13ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-13 18:18:59,135 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.30ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 53.3MB in the end (delta: 10.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.01ms. Allocated memory is still 86.0MB. Free memory was 53.3MB in the beginning and 50.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.29ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1025.89ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 69.6MB in the end (delta: -21.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 60852.18ms. Allocated memory was 104.9MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 69.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 887.2MB. Max. memory is 16.1GB. * Witness Printer took 149.13ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. 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 - CounterExampleResult [Line: 611]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-128, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.6s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25866 SdHoareTripleChecker+Valid, 17.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25651 mSDsluCounter, 67482 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52911 mSDsCounter, 8497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19463 IncrementalHoareTripleChecker+Invalid, 27960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8497 mSolverCounterUnsat, 14571 mSDtfsCounter, 19463 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3100 GetRequests, 2625 SyntacticMatches, 8 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9937 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8084occurred in iteration=29, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 38497 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 5170 NumberOfCodeBlocks, 5170 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5884 ConstructedInterpolants, 0 QuantifiedInterpolants, 14152 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 44 InterpolantComputations, 30 PerfectInterpolantSequences, 1923/2111 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 proved your program to be incorrect! [2022-07-13 18:18:59,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE