./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 54858612 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 95cc0587a388c24bd8fe79daa8a2c937f8af6740 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 23:17:43,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:17:43,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:17:43,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:17:43,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:17:43,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:17:43,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:17:43,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:17:43,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:17:43,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:17:43,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:17:43,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:17:43,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:17:43,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:17:43,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:17:43,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:17:43,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:17:43,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:17:43,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:17:43,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:17:43,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:17:43,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:17:43,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:17:43,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:17:43,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:17:43,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:17:43,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:17:44,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:17:44,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:17:44,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:17:44,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:17:44,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:17:44,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:17:44,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:17:44,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:17:44,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:17:44,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:17:44,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:17:44,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:17:44,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:17:44,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:17:44,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:17:44,085 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:17:44,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:17:44,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:17:44,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:17:44,089 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:17:44,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:17:44,089 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:17:44,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:17:44,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:17:44,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:17:44,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:17:44,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:17:44,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:17:44,092 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:17:44,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:17:44,092 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:17:44,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:17:44,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:17:44,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:17:44,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:17:44,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:17:44,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:17:44,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:17:44,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:17:44,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:17:44,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:17:44,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:17:44,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:17:44,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:17:44,095 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 -> 95cc0587a388c24bd8fe79daa8a2c937f8af6740 [2020-10-25 23:17:44,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:17:44,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:17:44,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:17:44,627 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:17:44,629 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:17:44,630 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 [2020-10-25 23:17:44,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8767fb698/c4b384edaee4432f99dc0bcceaf31879/FLAG6153ce11b [2020-10-25 23:17:45,359 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:17:45,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-10-25 23:17:45,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8767fb698/c4b384edaee4432f99dc0bcceaf31879/FLAG6153ce11b [2020-10-25 23:17:45,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8767fb698/c4b384edaee4432f99dc0bcceaf31879 [2020-10-25 23:17:45,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:17:45,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:17:45,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:17:45,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:17:45,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:17:45,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:17:45" (1/1) ... [2020-10-25 23:17:45,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d68d2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:45, skipping insertion in model container [2020-10-25 23:17:45,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:17:45" (1/1) ... [2020-10-25 23:17:45,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:17:45,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:17:46,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:17:46,094 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:17:46,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:17:46,235 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:17:46,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46 WrapperNode [2020-10-25 23:17:46,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:17:46,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:17:46,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:17:46,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:17:46,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:17:46,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:17:46,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:17:46,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:17:46,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... [2020-10-25 23:17:46,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:17:46,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:17:46,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:17:46,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:17:46,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:17:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:17:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:17:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:17:46,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:17:47,957 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:17:47,957 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-10-25 23:17:47,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:17:47 BoogieIcfgContainer [2020-10-25 23:17:47,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:17:47,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:17:47,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:17:47,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:17:47,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:17:45" (1/3) ... [2020-10-25 23:17:47,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9766d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:17:47, skipping insertion in model container [2020-10-25 23:17:47,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:17:46" (2/3) ... [2020-10-25 23:17:47,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9766d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:17:47, skipping insertion in model container [2020-10-25 23:17:47,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:17:47" (3/3) ... [2020-10-25 23:17:47,969 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-10-25 23:17:47,983 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:17:47,988 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-10-25 23:17:48,002 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-10-25 23:17:48,032 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:17:48,032 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:17:48,032 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:17:48,033 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:17:48,033 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:17:48,033 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:17:48,033 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:17:48,033 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:17:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states. [2020-10-25 23:17:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 23:17:48,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:48,076 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:48,077 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-10-25 23:17:48,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:48,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737646737] [2020-10-25 23:17:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:48,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737646737] [2020-10-25 23:17:48,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:48,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:17:48,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285682975] [2020-10-25 23:17:48,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 23:17:48,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 23:17:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 23:17:48,463 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 2 states. [2020-10-25 23:17:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:48,520 INFO L93 Difference]: Finished difference Result 597 states and 916 transitions. [2020-10-25 23:17:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 23:17:48,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-10-25 23:17:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:48,540 INFO L225 Difference]: With dead ends: 597 [2020-10-25 23:17:48,540 INFO L226 Difference]: Without dead ends: 291 [2020-10-25 23:17:48,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 23:17:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-25 23:17:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-10-25 23:17:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-10-25 23:17:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-10-25 23:17:48,618 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 33 [2020-10-25 23:17:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:48,619 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-10-25 23:17:48,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 23:17:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2020-10-25 23:17:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 23:17:48,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:48,622 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:48,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:17:48,622 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-10-25 23:17:48,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:48,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471624544] [2020-10-25 23:17:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:48,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471624544] [2020-10-25 23:17:48,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:48,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:48,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178220690] [2020-10-25 23:17:48,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:48,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:48,739 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2020-10-25 23:17:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:48,840 INFO L93 Difference]: Finished difference Result 568 states and 824 transitions. [2020-10-25 23:17:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:17:48,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-10-25 23:17:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:48,844 INFO L225 Difference]: With dead ends: 568 [2020-10-25 23:17:48,844 INFO L226 Difference]: Without dead ends: 291 [2020-10-25 23:17:48,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-25 23:17:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-10-25 23:17:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-10-25 23:17:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2020-10-25 23:17:48,868 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 33 [2020-10-25 23:17:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:48,868 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2020-10-25 23:17:48,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2020-10-25 23:17:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-25 23:17:48,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:48,870 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:48,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:17:48,871 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-10-25 23:17:48,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:48,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340329827] [2020-10-25 23:17:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:49,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340329827] [2020-10-25 23:17:49,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:49,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:49,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543938829] [2020-10-25 23:17:49,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:49,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,087 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand 3 states. [2020-10-25 23:17:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:49,168 INFO L93 Difference]: Finished difference Result 599 states and 859 transitions. [2020-10-25 23:17:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:49,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-25 23:17:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:49,173 INFO L225 Difference]: With dead ends: 599 [2020-10-25 23:17:49,173 INFO L226 Difference]: Without dead ends: 325 [2020-10-25 23:17:49,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-10-25 23:17:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 267. [2020-10-25 23:17:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-10-25 23:17:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2020-10-25 23:17:49,200 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 44 [2020-10-25 23:17:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:49,201 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2020-10-25 23:17:49,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2020-10-25 23:17:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-25 23:17:49,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:49,206 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:49,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:17:49,206 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-10-25 23:17:49,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:49,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929423315] [2020-10-25 23:17:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:49,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929423315] [2020-10-25 23:17:49,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:49,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:49,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914933445] [2020-10-25 23:17:49,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:49,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,382 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand 3 states. [2020-10-25 23:17:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:49,423 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2020-10-25 23:17:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:49,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-10-25 23:17:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:49,427 INFO L225 Difference]: With dead ends: 744 [2020-10-25 23:17:49,428 INFO L226 Difference]: Without dead ends: 494 [2020-10-25 23:17:49,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-25 23:17:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 300. [2020-10-25 23:17:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-10-25 23:17:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2020-10-25 23:17:49,449 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 53 [2020-10-25 23:17:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:49,449 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2020-10-25 23:17:49,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2020-10-25 23:17:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-25 23:17:49,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:49,452 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:49,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:17:49,452 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1464669016, now seen corresponding path program 1 times [2020-10-25 23:17:49,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:49,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854804801] [2020-10-25 23:17:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:49,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854804801] [2020-10-25 23:17:49,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:49,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:49,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576031754] [2020-10-25 23:17:49,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:49,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,566 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand 3 states. [2020-10-25 23:17:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:49,607 INFO L93 Difference]: Finished difference Result 822 states and 1175 transitions. [2020-10-25 23:17:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:49,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-10-25 23:17:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:49,612 INFO L225 Difference]: With dead ends: 822 [2020-10-25 23:17:49,613 INFO L226 Difference]: Without dead ends: 539 [2020-10-25 23:17:49,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-10-25 23:17:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 321. [2020-10-25 23:17:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-10-25 23:17:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2020-10-25 23:17:49,630 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 54 [2020-10-25 23:17:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:49,631 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2020-10-25 23:17:49,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2020-10-25 23:17:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-25 23:17:49,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:49,634 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:49,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:17:49,635 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -784610646, now seen corresponding path program 1 times [2020-10-25 23:17:49,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:49,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112616747] [2020-10-25 23:17:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:49,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112616747] [2020-10-25 23:17:49,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:49,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:49,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936437341] [2020-10-25 23:17:49,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:17:49,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:17:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:49,750 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand 5 states. [2020-10-25 23:17:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:50,020 INFO L93 Difference]: Finished difference Result 1003 states and 1436 transitions. [2020-10-25 23:17:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:17:50,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-10-25 23:17:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:50,026 INFO L225 Difference]: With dead ends: 1003 [2020-10-25 23:17:50,026 INFO L226 Difference]: Without dead ends: 699 [2020-10-25 23:17:50,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 23:17:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-10-25 23:17:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-10-25 23:17:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-25 23:17:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 592 transitions. [2020-10-25 23:17:50,060 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 592 transitions. Word has length 54 [2020-10-25 23:17:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:50,064 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 592 transitions. [2020-10-25 23:17:50,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:17:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 592 transitions. [2020-10-25 23:17:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-10-25 23:17:50,071 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:50,071 INFO L422 BasicCegarLoop]: 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] [2020-10-25 23:17:50,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:17:50,072 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1195121816, now seen corresponding path program 1 times [2020-10-25 23:17:50,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:50,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384832474] [2020-10-25 23:17:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:50,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384832474] [2020-10-25 23:17:50,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:50,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:50,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774318569] [2020-10-25 23:17:50,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:17:50,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:17:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:50,234 INFO L87 Difference]: Start difference. First operand 419 states and 592 transitions. Second operand 5 states. [2020-10-25 23:17:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:50,518 INFO L93 Difference]: Finished difference Result 1003 states and 1428 transitions. [2020-10-25 23:17:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:17:50,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-10-25 23:17:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:50,524 INFO L225 Difference]: With dead ends: 1003 [2020-10-25 23:17:50,524 INFO L226 Difference]: Without dead ends: 699 [2020-10-25 23:17:50,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 23:17:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-10-25 23:17:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-10-25 23:17:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-25 23:17:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2020-10-25 23:17:50,549 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 55 [2020-10-25 23:17:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:50,551 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2020-10-25 23:17:50,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:17:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2020-10-25 23:17:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-25 23:17:50,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:50,553 INFO L422 BasicCegarLoop]: 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, 1] [2020-10-25 23:17:50,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:17:50,553 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-10-25 23:17:50,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:50,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175211963] [2020-10-25 23:17:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:50,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175211963] [2020-10-25 23:17:50,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:50,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:50,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892073251] [2020-10-25 23:17:50,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:50,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:50,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:50,688 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2020-10-25 23:17:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:50,753 INFO L93 Difference]: Finished difference Result 843 states and 1199 transitions. [2020-10-25 23:17:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:50,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-10-25 23:17:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:50,759 INFO L225 Difference]: With dead ends: 843 [2020-10-25 23:17:50,759 INFO L226 Difference]: Without dead ends: 539 [2020-10-25 23:17:50,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-10-25 23:17:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 414. [2020-10-25 23:17:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-25 23:17:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 580 transitions. [2020-10-25 23:17:50,786 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 580 transitions. Word has length 56 [2020-10-25 23:17:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:50,787 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 580 transitions. [2020-10-25 23:17:50,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 580 transitions. [2020-10-25 23:17:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-25 23:17:50,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:50,790 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2020-10-25 23:17:50,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:17:50,791 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 819502993, now seen corresponding path program 1 times [2020-10-25 23:17:50,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:50,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283997295] [2020-10-25 23:17:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:50,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283997295] [2020-10-25 23:17:50,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:50,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:50,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546554643] [2020-10-25 23:17:50,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:50,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:50,892 INFO L87 Difference]: Start difference. First operand 414 states and 580 transitions. Second operand 3 states. [2020-10-25 23:17:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:50,973 INFO L93 Difference]: Finished difference Result 842 states and 1198 transitions. [2020-10-25 23:17:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-10-25 23:17:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:50,989 INFO L225 Difference]: With dead ends: 842 [2020-10-25 23:17:50,989 INFO L226 Difference]: Without dead ends: 543 [2020-10-25 23:17:50,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-10-25 23:17:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 394. [2020-10-25 23:17:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-25 23:17:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2020-10-25 23:17:51,015 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 60 [2020-10-25 23:17:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:51,015 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2020-10-25 23:17:51,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2020-10-25 23:17:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-25 23:17:51,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:51,017 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:51,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:17:51,018 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -69192917, now seen corresponding path program 1 times [2020-10-25 23:17:51,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:51,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191947484] [2020-10-25 23:17:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:51,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191947484] [2020-10-25 23:17:51,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:51,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:51,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827559971] [2020-10-25 23:17:51,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:51,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:51,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,083 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand 3 states. [2020-10-25 23:17:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:51,149 INFO L93 Difference]: Finished difference Result 810 states and 1142 transitions. [2020-10-25 23:17:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:51,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-25 23:17:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:51,153 INFO L225 Difference]: With dead ends: 810 [2020-10-25 23:17:51,153 INFO L226 Difference]: Without dead ends: 531 [2020-10-25 23:17:51,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-10-25 23:17:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-10-25 23:17:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-10-25 23:17:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 530 transitions. [2020-10-25 23:17:51,175 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 530 transitions. Word has length 64 [2020-10-25 23:17:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:51,175 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 530 transitions. [2020-10-25 23:17:51,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 530 transitions. [2020-10-25 23:17:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-25 23:17:51,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:51,176 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:51,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:17:51,177 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1588224041, now seen corresponding path program 1 times [2020-10-25 23:17:51,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:51,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389033276] [2020-10-25 23:17:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:51,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389033276] [2020-10-25 23:17:51,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:51,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:51,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351249042] [2020-10-25 23:17:51,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:51,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:51,265 INFO L87 Difference]: Start difference. First operand 382 states and 530 transitions. Second operand 6 states. [2020-10-25 23:17:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:51,438 INFO L93 Difference]: Finished difference Result 1412 states and 1981 transitions. [2020-10-25 23:17:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 23:17:51,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-10-25 23:17:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:51,445 INFO L225 Difference]: With dead ends: 1412 [2020-10-25 23:17:51,445 INFO L226 Difference]: Without dead ends: 1145 [2020-10-25 23:17:51,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:17:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-10-25 23:17:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 403. [2020-10-25 23:17:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-25 23:17:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 554 transitions. [2020-10-25 23:17:51,474 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 554 transitions. Word has length 65 [2020-10-25 23:17:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:51,474 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 554 transitions. [2020-10-25 23:17:51,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 554 transitions. [2020-10-25 23:17:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-25 23:17:51,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:51,476 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:51,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:17:51,476 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1255523790, now seen corresponding path program 1 times [2020-10-25 23:17:51,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:51,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551684424] [2020-10-25 23:17:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:51,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551684424] [2020-10-25 23:17:51,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:51,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:51,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209532688] [2020-10-25 23:17:51,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:51,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,559 INFO L87 Difference]: Start difference. First operand 403 states and 554 transitions. Second operand 3 states. [2020-10-25 23:17:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:51,648 INFO L93 Difference]: Finished difference Result 827 states and 1158 transitions. [2020-10-25 23:17:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:51,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-10-25 23:17:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:51,651 INFO L225 Difference]: With dead ends: 827 [2020-10-25 23:17:51,652 INFO L226 Difference]: Without dead ends: 560 [2020-10-25 23:17:51,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-25 23:17:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-10-25 23:17:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-25 23:17:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2020-10-25 23:17:51,676 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 67 [2020-10-25 23:17:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:51,676 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2020-10-25 23:17:51,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2020-10-25 23:17:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-25 23:17:51,677 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:51,678 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:51,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:17:51,678 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -363592984, now seen corresponding path program 1 times [2020-10-25 23:17:51,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:51,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434905504] [2020-10-25 23:17:51,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:51,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434905504] [2020-10-25 23:17:51,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:51,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:51,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768890357] [2020-10-25 23:17:51,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:51,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:51,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,738 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 3 states. [2020-10-25 23:17:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:51,818 INFO L93 Difference]: Finished difference Result 795 states and 1102 transitions. [2020-10-25 23:17:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:51,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-10-25 23:17:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:51,822 INFO L225 Difference]: With dead ends: 795 [2020-10-25 23:17:51,822 INFO L226 Difference]: Without dead ends: 548 [2020-10-25 23:17:51,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-25 23:17:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2020-10-25 23:17:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-25 23:17:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions. [2020-10-25 23:17:51,847 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 71 [2020-10-25 23:17:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:51,847 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 504 transitions. [2020-10-25 23:17:51,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions. [2020-10-25 23:17:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-25 23:17:51,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:51,848 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:51,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:17:51,849 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2014081046, now seen corresponding path program 1 times [2020-10-25 23:17:51,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:51,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622641999] [2020-10-25 23:17:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:52,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622641999] [2020-10-25 23:17:52,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:52,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:52,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626467158] [2020-10-25 23:17:52,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:52,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:52,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:52,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:52,005 INFO L87 Difference]: Start difference. First operand 371 states and 504 transitions. Second operand 6 states. [2020-10-25 23:17:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:52,256 INFO L93 Difference]: Finished difference Result 1063 states and 1470 transitions. [2020-10-25 23:17:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 23:17:52,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-10-25 23:17:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:52,261 INFO L225 Difference]: With dead ends: 1063 [2020-10-25 23:17:52,261 INFO L226 Difference]: Without dead ends: 828 [2020-10-25 23:17:52,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:17:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-10-25 23:17:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 396. [2020-10-25 23:17:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-25 23:17:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 539 transitions. [2020-10-25 23:17:52,294 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 539 transitions. Word has length 74 [2020-10-25 23:17:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:52,294 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 539 transitions. [2020-10-25 23:17:52,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 539 transitions. [2020-10-25 23:17:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-25 23:17:52,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:52,296 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:52,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:17:52,296 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1105027455, now seen corresponding path program 1 times [2020-10-25 23:17:52,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:52,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343478231] [2020-10-25 23:17:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:52,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343478231] [2020-10-25 23:17:52,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:52,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:52,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711056121] [2020-10-25 23:17:52,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:52,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:52,418 INFO L87 Difference]: Start difference. First operand 396 states and 539 transitions. Second operand 6 states. [2020-10-25 23:17:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:52,851 INFO L93 Difference]: Finished difference Result 1384 states and 1903 transitions. [2020-10-25 23:17:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 23:17:52,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-10-25 23:17:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:52,857 INFO L225 Difference]: With dead ends: 1384 [2020-10-25 23:17:52,858 INFO L226 Difference]: Without dead ends: 1131 [2020-10-25 23:17:52,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:17:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2020-10-25 23:17:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 424. [2020-10-25 23:17:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-25 23:17:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2020-10-25 23:17:52,906 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 74 [2020-10-25 23:17:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:52,907 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2020-10-25 23:17:52,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2020-10-25 23:17:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-25 23:17:52,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:52,909 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:52,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:17:52,909 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-10-25 23:17:52,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:52,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991190571] [2020-10-25 23:17:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:53,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991190571] [2020-10-25 23:17:53,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:53,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:53,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557668324] [2020-10-25 23:17:53,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:53,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:53,025 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand 4 states. [2020-10-25 23:17:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:53,197 INFO L93 Difference]: Finished difference Result 1099 states and 1491 transitions. [2020-10-25 23:17:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:17:53,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-25 23:17:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:53,202 INFO L225 Difference]: With dead ends: 1099 [2020-10-25 23:17:53,202 INFO L226 Difference]: Without dead ends: 840 [2020-10-25 23:17:53,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-10-25 23:17:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 637. [2020-10-25 23:17:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-25 23:17:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 846 transitions. [2020-10-25 23:17:53,258 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 846 transitions. Word has length 74 [2020-10-25 23:17:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:53,259 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 846 transitions. [2020-10-25 23:17:53,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 846 transitions. [2020-10-25 23:17:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-25 23:17:53,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:53,260 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:53,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:17:53,261 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1739304111, now seen corresponding path program 1 times [2020-10-25 23:17:53,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:53,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932663316] [2020-10-25 23:17:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:53,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932663316] [2020-10-25 23:17:53,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:53,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:53,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273244751] [2020-10-25 23:17:53,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:53,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:53,375 INFO L87 Difference]: Start difference. First operand 637 states and 846 transitions. Second operand 3 states. [2020-10-25 23:17:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:53,469 INFO L93 Difference]: Finished difference Result 1118 states and 1514 transitions. [2020-10-25 23:17:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:53,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-25 23:17:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:53,474 INFO L225 Difference]: With dead ends: 1118 [2020-10-25 23:17:53,474 INFO L226 Difference]: Without dead ends: 748 [2020-10-25 23:17:53,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-10-25 23:17:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 633. [2020-10-25 23:17:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-25 23:17:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 839 transitions. [2020-10-25 23:17:53,547 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 839 transitions. Word has length 75 [2020-10-25 23:17:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:53,548 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 839 transitions. [2020-10-25 23:17:53,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 839 transitions. [2020-10-25 23:17:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 23:17:53,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:53,555 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:53,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:17:53,557 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash -450501806, now seen corresponding path program 1 times [2020-10-25 23:17:53,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:53,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435613954] [2020-10-25 23:17:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:53,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435613954] [2020-10-25 23:17:53,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:53,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:53,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089715063] [2020-10-25 23:17:53,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:53,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:53,699 INFO L87 Difference]: Start difference. First operand 633 states and 839 transitions. Second operand 4 states. [2020-10-25 23:17:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:53,946 INFO L93 Difference]: Finished difference Result 1425 states and 1907 transitions. [2020-10-25 23:17:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:17:53,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 23:17:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:53,953 INFO L225 Difference]: With dead ends: 1425 [2020-10-25 23:17:53,953 INFO L226 Difference]: Without dead ends: 1045 [2020-10-25 23:17:53,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-25 23:17:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 844. [2020-10-25 23:17:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2020-10-25 23:17:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1109 transitions. [2020-10-25 23:17:54,040 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1109 transitions. Word has length 76 [2020-10-25 23:17:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:54,040 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1109 transitions. [2020-10-25 23:17:54,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1109 transitions. [2020-10-25 23:17:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 23:17:54,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:54,042 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:54,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:17:54,043 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:54,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1063318036, now seen corresponding path program 1 times [2020-10-25 23:17:54,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:54,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398283465] [2020-10-25 23:17:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:54,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398283465] [2020-10-25 23:17:54,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:54,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:54,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551432130] [2020-10-25 23:17:54,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:54,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:54,216 INFO L87 Difference]: Start difference. First operand 844 states and 1109 transitions. Second operand 6 states. [2020-10-25 23:17:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:54,784 INFO L93 Difference]: Finished difference Result 3164 states and 4201 transitions. [2020-10-25 23:17:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 23:17:54,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-10-25 23:17:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:54,797 INFO L225 Difference]: With dead ends: 3164 [2020-10-25 23:17:54,797 INFO L226 Difference]: Without dead ends: 2657 [2020-10-25 23:17:54,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:17:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2020-10-25 23:17:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 970. [2020-10-25 23:17:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-10-25 23:17:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1256 transitions. [2020-10-25 23:17:54,903 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1256 transitions. Word has length 76 [2020-10-25 23:17:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:54,903 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1256 transitions. [2020-10-25 23:17:54,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1256 transitions. [2020-10-25 23:17:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-25 23:17:54,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:54,906 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:54,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:17:54,906 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-10-25 23:17:54,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:54,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482953796] [2020-10-25 23:17:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:54,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482953796] [2020-10-25 23:17:54,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:54,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:54,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941316521] [2020-10-25 23:17:54,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:54,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:54,981 INFO L87 Difference]: Start difference. First operand 970 states and 1256 transitions. Second operand 4 states. [2020-10-25 23:17:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:55,224 INFO L93 Difference]: Finished difference Result 2345 states and 3078 transitions. [2020-10-25 23:17:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:17:55,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-25 23:17:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:55,234 INFO L225 Difference]: With dead ends: 2345 [2020-10-25 23:17:55,234 INFO L226 Difference]: Without dead ends: 1790 [2020-10-25 23:17:55,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-10-25 23:17:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1311. [2020-10-25 23:17:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2020-10-25 23:17:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1691 transitions. [2020-10-25 23:17:55,399 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1691 transitions. Word has length 77 [2020-10-25 23:17:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:55,399 INFO L481 AbstractCegarLoop]: Abstraction has 1311 states and 1691 transitions. [2020-10-25 23:17:55,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1691 transitions. [2020-10-25 23:17:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-25 23:17:55,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:55,402 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:55,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 23:17:55,402 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 236706532, now seen corresponding path program 1 times [2020-10-25 23:17:55,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:55,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152041751] [2020-10-25 23:17:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:55,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152041751] [2020-10-25 23:17:55,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:55,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:55,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564896804] [2020-10-25 23:17:55,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:55,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:55,447 INFO L87 Difference]: Start difference. First operand 1311 states and 1691 transitions. Second operand 3 states. [2020-10-25 23:17:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:55,751 INFO L93 Difference]: Finished difference Result 3105 states and 4022 transitions. [2020-10-25 23:17:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:55,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-10-25 23:17:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:55,761 INFO L225 Difference]: With dead ends: 3105 [2020-10-25 23:17:55,762 INFO L226 Difference]: Without dead ends: 2156 [2020-10-25 23:17:55,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2020-10-25 23:17:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1313. [2020-10-25 23:17:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2020-10-25 23:17:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1693 transitions. [2020-10-25 23:17:55,915 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1693 transitions. Word has length 78 [2020-10-25 23:17:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:55,915 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1693 transitions. [2020-10-25 23:17:55,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1693 transitions. [2020-10-25 23:17:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 23:17:55,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:55,918 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:55,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 23:17:55,918 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1666890696, now seen corresponding path program 1 times [2020-10-25 23:17:55,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:55,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187159924] [2020-10-25 23:17:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:56,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187159924] [2020-10-25 23:17:56,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:56,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:56,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039165433] [2020-10-25 23:17:56,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:56,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:56,020 INFO L87 Difference]: Start difference. First operand 1313 states and 1693 transitions. Second operand 6 states. [2020-10-25 23:17:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:56,330 INFO L93 Difference]: Finished difference Result 2077 states and 2712 transitions. [2020-10-25 23:17:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:17:56,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-10-25 23:17:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:56,339 INFO L225 Difference]: With dead ends: 2077 [2020-10-25 23:17:56,340 INFO L226 Difference]: Without dead ends: 2075 [2020-10-25 23:17:56,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:17:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-10-25 23:17:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1315. [2020-10-25 23:17:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-10-25 23:17:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1695 transitions. [2020-10-25 23:17:56,470 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1695 transitions. Word has length 79 [2020-10-25 23:17:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:56,470 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1695 transitions. [2020-10-25 23:17:56,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1695 transitions. [2020-10-25 23:17:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 23:17:56,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:56,472 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:56,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 23:17:56,472 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -275805135, now seen corresponding path program 1 times [2020-10-25 23:17:56,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:56,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749316640] [2020-10-25 23:17:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:56,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749316640] [2020-10-25 23:17:56,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:56,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:56,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091750759] [2020-10-25 23:17:56,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:56,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:56,608 INFO L87 Difference]: Start difference. First operand 1315 states and 1695 transitions. Second operand 6 states. [2020-10-25 23:17:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:57,103 INFO L93 Difference]: Finished difference Result 3115 states and 4121 transitions. [2020-10-25 23:17:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 23:17:57,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-10-25 23:17:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:57,116 INFO L225 Difference]: With dead ends: 3115 [2020-10-25 23:17:57,116 INFO L226 Difference]: Without dead ends: 2320 [2020-10-25 23:17:57,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:17:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2020-10-25 23:17:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1315. [2020-10-25 23:17:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-10-25 23:17:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1683 transitions. [2020-10-25 23:17:57,281 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1683 transitions. Word has length 79 [2020-10-25 23:17:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:57,281 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1683 transitions. [2020-10-25 23:17:57,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1683 transitions. [2020-10-25 23:17:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 23:17:57,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:57,284 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:57,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 23:17:57,284 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1725608005, now seen corresponding path program 1 times [2020-10-25 23:17:57,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:57,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266808785] [2020-10-25 23:17:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:57,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266808785] [2020-10-25 23:17:57,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:57,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:57,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62644485] [2020-10-25 23:17:57,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:57,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:57,394 INFO L87 Difference]: Start difference. First operand 1315 states and 1683 transitions. Second operand 4 states. [2020-10-25 23:17:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:57,596 INFO L93 Difference]: Finished difference Result 2627 states and 3386 transitions. [2020-10-25 23:17:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:17:57,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-10-25 23:17:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:57,603 INFO L225 Difference]: With dead ends: 2627 [2020-10-25 23:17:57,604 INFO L226 Difference]: Without dead ends: 1384 [2020-10-25 23:17:57,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-10-25 23:17:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1027. [2020-10-25 23:17:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2020-10-25 23:17:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1327 transitions. [2020-10-25 23:17:57,722 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1327 transitions. Word has length 79 [2020-10-25 23:17:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:57,723 INFO L481 AbstractCegarLoop]: Abstraction has 1027 states and 1327 transitions. [2020-10-25 23:17:57,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1327 transitions. [2020-10-25 23:17:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-25 23:17:57,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:57,724 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:57,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 23:17:57,725 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-10-25 23:17:57,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:57,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909197040] [2020-10-25 23:17:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:57,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909197040] [2020-10-25 23:17:57,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:57,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:17:57,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213166340] [2020-10-25 23:17:57,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:17:57,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:17:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:57,772 INFO L87 Difference]: Start difference. First operand 1027 states and 1327 transitions. Second operand 3 states. [2020-10-25 23:17:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:58,061 INFO L93 Difference]: Finished difference Result 2433 states and 3163 transitions. [2020-10-25 23:17:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:17:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-10-25 23:17:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:58,089 INFO L225 Difference]: With dead ends: 2433 [2020-10-25 23:17:58,089 INFO L226 Difference]: Without dead ends: 1550 [2020-10-25 23:17:58,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:17:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2020-10-25 23:17:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1033. [2020-10-25 23:17:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-10-25 23:17:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1333 transitions. [2020-10-25 23:17:58,212 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1333 transitions. Word has length 80 [2020-10-25 23:17:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:58,213 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 1333 transitions. [2020-10-25 23:17:58,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:17:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1333 transitions. [2020-10-25 23:17:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-25 23:17:58,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:58,215 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:58,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 23:17:58,215 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1203231905, now seen corresponding path program 1 times [2020-10-25 23:17:58,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:58,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766843280] [2020-10-25 23:17:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:58,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766843280] [2020-10-25 23:17:58,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:58,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:17:58,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92744489] [2020-10-25 23:17:58,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:17:58,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:17:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:17:58,294 INFO L87 Difference]: Start difference. First operand 1033 states and 1333 transitions. Second operand 4 states. [2020-10-25 23:17:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:58,511 INFO L93 Difference]: Finished difference Result 2381 states and 3087 transitions. [2020-10-25 23:17:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:17:58,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-10-25 23:17:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:58,518 INFO L225 Difference]: With dead ends: 2381 [2020-10-25 23:17:58,519 INFO L226 Difference]: Without dead ends: 1444 [2020-10-25 23:17:58,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:17:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-10-25 23:17:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 975. [2020-10-25 23:17:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2020-10-25 23:17:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1253 transitions. [2020-10-25 23:17:58,638 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1253 transitions. Word has length 80 [2020-10-25 23:17:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:58,639 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1253 transitions. [2020-10-25 23:17:58,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:17:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1253 transitions. [2020-10-25 23:17:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-25 23:17:58,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:58,640 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:58,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 23:17:58,647 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash -868242773, now seen corresponding path program 1 times [2020-10-25 23:17:58,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:58,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533384982] [2020-10-25 23:17:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:58,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533384982] [2020-10-25 23:17:58,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:58,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:58,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393799492] [2020-10-25 23:17:58,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:58,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:58,806 INFO L87 Difference]: Start difference. First operand 975 states and 1253 transitions. Second operand 6 states. [2020-10-25 23:17:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:59,392 INFO L93 Difference]: Finished difference Result 3200 states and 4277 transitions. [2020-10-25 23:17:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 23:17:59,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-10-25 23:17:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:59,400 INFO L225 Difference]: With dead ends: 3200 [2020-10-25 23:17:59,400 INFO L226 Difference]: Without dead ends: 2416 [2020-10-25 23:17:59,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:17:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2020-10-25 23:17:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 963. [2020-10-25 23:17:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-10-25 23:17:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1241 transitions. [2020-10-25 23:17:59,533 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1241 transitions. Word has length 82 [2020-10-25 23:17:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:17:59,533 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 1241 transitions. [2020-10-25 23:17:59,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:17:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1241 transitions. [2020-10-25 23:17:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-25 23:17:59,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:17:59,535 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:17:59,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 23:17:59,535 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:17:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:17:59,536 INFO L82 PathProgramCache]: Analyzing trace with hash 528163420, now seen corresponding path program 1 times [2020-10-25 23:17:59,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:17:59,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532409960] [2020-10-25 23:17:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:17:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:17:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:17:59,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532409960] [2020-10-25 23:17:59,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:17:59,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:17:59,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866427882] [2020-10-25 23:17:59,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:17:59,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:17:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:17:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:17:59,636 INFO L87 Difference]: Start difference. First operand 963 states and 1241 transitions. Second operand 6 states. [2020-10-25 23:17:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:17:59,971 INFO L93 Difference]: Finished difference Result 2288 states and 3068 transitions. [2020-10-25 23:17:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 23:17:59,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-10-25 23:17:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:17:59,978 INFO L225 Difference]: With dead ends: 2288 [2020-10-25 23:17:59,983 INFO L226 Difference]: Without dead ends: 1504 [2020-10-25 23:17:59,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:17:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2020-10-25 23:18:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 969. [2020-10-25 23:18:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-10-25 23:18:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1247 transitions. [2020-10-25 23:18:00,116 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1247 transitions. Word has length 83 [2020-10-25 23:18:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:00,116 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1247 transitions. [2020-10-25 23:18:00,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:18:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1247 transitions. [2020-10-25 23:18:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:18:00,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:00,121 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:00,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 23:18:00,121 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -953396613, now seen corresponding path program 1 times [2020-10-25 23:18:00,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:00,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723635059] [2020-10-25 23:18:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:00,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723635059] [2020-10-25 23:18:00,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451349965] [2020-10-25 23:18:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:00,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 23:18:00,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:00,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 23:18:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:02,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:02,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-10-25 23:18:02,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027490350] [2020-10-25 23:18:02,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 23:18:02,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 23:18:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:18:02,526 INFO L87 Difference]: Start difference. First operand 969 states and 1247 transitions. Second operand 12 states. [2020-10-25 23:18:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:04,481 INFO L93 Difference]: Finished difference Result 4203 states and 5524 transitions. [2020-10-25 23:18:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-25 23:18:04,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2020-10-25 23:18:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:04,489 INFO L225 Difference]: With dead ends: 4203 [2020-10-25 23:18:04,490 INFO L226 Difference]: Without dead ends: 3419 [2020-10-25 23:18:04,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2020-10-25 23:18:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2020-10-25 23:18:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 1365. [2020-10-25 23:18:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2020-10-25 23:18:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1774 transitions. [2020-10-25 23:18:04,781 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1774 transitions. Word has length 133 [2020-10-25 23:18:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:04,781 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 1774 transitions. [2020-10-25 23:18:04,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 23:18:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1774 transitions. [2020-10-25 23:18:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:18:04,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:04,785 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:04,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-10-25 23:18:04,999 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2082030467, now seen corresponding path program 1 times [2020-10-25 23:18:05,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:05,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889909881] [2020-10-25 23:18:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:05,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889909881] [2020-10-25 23:18:05,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645460015] [2020-10-25 23:18:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:05,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 23:18:05,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-10-25 23:18:05,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:18:05,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-10-25 23:18:05,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316077799] [2020-10-25 23:18:05,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:18:05,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:18:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:18:05,461 INFO L87 Difference]: Start difference. First operand 1365 states and 1774 transitions. Second operand 4 states. [2020-10-25 23:18:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:05,770 INFO L93 Difference]: Finished difference Result 2593 states and 3388 transitions. [2020-10-25 23:18:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:18:05,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-10-25 23:18:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:05,774 INFO L225 Difference]: With dead ends: 2593 [2020-10-25 23:18:05,775 INFO L226 Difference]: Without dead ends: 1316 [2020-10-25 23:18:05,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:18:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2020-10-25 23:18:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2020-10-25 23:18:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2020-10-25 23:18:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1703 transitions. [2020-10-25 23:18:06,060 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1703 transitions. Word has length 133 [2020-10-25 23:18:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:06,060 INFO L481 AbstractCegarLoop]: Abstraction has 1316 states and 1703 transitions. [2020-10-25 23:18:06,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:18:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1703 transitions. [2020-10-25 23:18:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:18:06,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:06,065 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:06,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:06,279 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 714786357, now seen corresponding path program 1 times [2020-10-25 23:18:06,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:06,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391967744] [2020-10-25 23:18:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:06,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391967744] [2020-10-25 23:18:06,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484601141] [2020-10-25 23:18:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:06,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 23:18:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:06,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 23:18:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:07,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:07,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-10-25 23:18:07,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7182259] [2020-10-25 23:18:07,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 23:18:07,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 23:18:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-25 23:18:07,063 INFO L87 Difference]: Start difference. First operand 1316 states and 1703 transitions. Second operand 16 states. [2020-10-25 23:18:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:09,419 INFO L93 Difference]: Finished difference Result 3938 states and 5156 transitions. [2020-10-25 23:18:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-25 23:18:09,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2020-10-25 23:18:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:09,426 INFO L225 Difference]: With dead ends: 3938 [2020-10-25 23:18:09,426 INFO L226 Difference]: Without dead ends: 2826 [2020-10-25 23:18:09,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2020-10-25 23:18:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2020-10-25 23:18:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1531. [2020-10-25 23:18:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2020-10-25 23:18:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1973 transitions. [2020-10-25 23:18:09,724 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1973 transitions. Word has length 133 [2020-10-25 23:18:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:09,725 INFO L481 AbstractCegarLoop]: Abstraction has 1531 states and 1973 transitions. [2020-10-25 23:18:09,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 23:18:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1973 transitions. [2020-10-25 23:18:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:18:09,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:09,728 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:09,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:09,942 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1258379021, now seen corresponding path program 1 times [2020-10-25 23:18:09,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:09,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882683848] [2020-10-25 23:18:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-25 23:18:10,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882683848] [2020-10-25 23:18:10,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:10,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:18:10,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053491216] [2020-10-25 23:18:10,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:18:10,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:18:10,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:18:10,047 INFO L87 Difference]: Start difference. First operand 1531 states and 1973 transitions. Second operand 5 states. [2020-10-25 23:18:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:10,376 INFO L93 Difference]: Finished difference Result 2808 states and 3658 transitions. [2020-10-25 23:18:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:18:10,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-10-25 23:18:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:10,380 INFO L225 Difference]: With dead ends: 2808 [2020-10-25 23:18:10,380 INFO L226 Difference]: Without dead ends: 1425 [2020-10-25 23:18:10,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:18:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-10-25 23:18:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2020-10-25 23:18:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2020-10-25 23:18:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1844 transitions. [2020-10-25 23:18:10,665 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1844 transitions. Word has length 133 [2020-10-25 23:18:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:10,667 INFO L481 AbstractCegarLoop]: Abstraction has 1425 states and 1844 transitions. [2020-10-25 23:18:10,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:18:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1844 transitions. [2020-10-25 23:18:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:18:10,678 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:10,678 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:10,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 23:18:10,679 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash -240157227, now seen corresponding path program 1 times [2020-10-25 23:18:10,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:10,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401086098] [2020-10-25 23:18:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:10,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401086098] [2020-10-25 23:18:10,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639545811] [2020-10-25 23:18:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:11,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 23:18:11,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:11,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 23:18:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:11,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:11,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-10-25 23:18:11,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924871979] [2020-10-25 23:18:11,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 23:18:11,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 23:18:11,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-25 23:18:11,412 INFO L87 Difference]: Start difference. First operand 1425 states and 1844 transitions. Second operand 16 states. [2020-10-25 23:18:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:13,804 INFO L93 Difference]: Finished difference Result 4291 states and 5639 transitions. [2020-10-25 23:18:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-25 23:18:13,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 134 [2020-10-25 23:18:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:13,810 INFO L225 Difference]: With dead ends: 4291 [2020-10-25 23:18:13,810 INFO L226 Difference]: Without dead ends: 3090 [2020-10-25 23:18:13,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2020-10-25 23:18:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2020-10-25 23:18:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1684. [2020-10-25 23:18:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-10-25 23:18:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2170 transitions. [2020-10-25 23:18:14,116 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2170 transitions. Word has length 134 [2020-10-25 23:18:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:14,116 INFO L481 AbstractCegarLoop]: Abstraction has 1684 states and 2170 transitions. [2020-10-25 23:18:14,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 23:18:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2170 transitions. [2020-10-25 23:18:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:18:14,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:14,119 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:14,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:14,320 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2129602969, now seen corresponding path program 1 times [2020-10-25 23:18:14,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:14,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581594595] [2020-10-25 23:18:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:14,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581594595] [2020-10-25 23:18:14,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:14,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-25 23:18:14,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978925681] [2020-10-25 23:18:14,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:18:14,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:14,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:18:14,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:18:14,577 INFO L87 Difference]: Start difference. First operand 1684 states and 2170 transitions. Second operand 10 states. [2020-10-25 23:18:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:15,822 INFO L93 Difference]: Finished difference Result 4207 states and 5473 transitions. [2020-10-25 23:18:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 23:18:15,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2020-10-25 23:18:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:15,829 INFO L225 Difference]: With dead ends: 4207 [2020-10-25 23:18:15,829 INFO L226 Difference]: Without dead ends: 2808 [2020-10-25 23:18:15,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2020-10-25 23:18:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2020-10-25 23:18:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1912. [2020-10-25 23:18:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2020-10-25 23:18:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2455 transitions. [2020-10-25 23:18:16,246 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2455 transitions. Word has length 134 [2020-10-25 23:18:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:16,246 INFO L481 AbstractCegarLoop]: Abstraction has 1912 states and 2455 transitions. [2020-10-25 23:18:16,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:18:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2455 transitions. [2020-10-25 23:18:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:18:16,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:16,251 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:16,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 23:18:16,251 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -232106203, now seen corresponding path program 1 times [2020-10-25 23:18:16,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:16,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637734176] [2020-10-25 23:18:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-25 23:18:16,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637734176] [2020-10-25 23:18:16,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:16,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:18:16,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587609713] [2020-10-25 23:18:16,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:18:16,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:18:16,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:18:16,379 INFO L87 Difference]: Start difference. First operand 1912 states and 2455 transitions. Second operand 5 states. [2020-10-25 23:18:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:16,868 INFO L93 Difference]: Finished difference Result 3451 states and 4490 transitions. [2020-10-25 23:18:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:18:16,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2020-10-25 23:18:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:16,872 INFO L225 Difference]: With dead ends: 3451 [2020-10-25 23:18:16,872 INFO L226 Difference]: Without dead ends: 1775 [2020-10-25 23:18:16,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:18:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2020-10-25 23:18:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2020-10-25 23:18:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2020-10-25 23:18:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2284 transitions. [2020-10-25 23:18:17,208 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2284 transitions. Word has length 134 [2020-10-25 23:18:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:17,208 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2284 transitions. [2020-10-25 23:18:17,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:18:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2284 transitions. [2020-10-25 23:18:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:18:17,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:17,212 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:17,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-25 23:18:17,212 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1912949591, now seen corresponding path program 1 times [2020-10-25 23:18:17,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:17,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37546077] [2020-10-25 23:18:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-25 23:18:17,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37546077] [2020-10-25 23:18:17,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:17,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:18:17,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709002246] [2020-10-25 23:18:17,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:18:17,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:18:17,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:18:17,266 INFO L87 Difference]: Start difference. First operand 1775 states and 2284 transitions. Second operand 4 states. [2020-10-25 23:18:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:17,617 INFO L93 Difference]: Finished difference Result 3203 states and 4160 transitions. [2020-10-25 23:18:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:18:17,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-10-25 23:18:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:17,620 INFO L225 Difference]: With dead ends: 3203 [2020-10-25 23:18:17,620 INFO L226 Difference]: Without dead ends: 1576 [2020-10-25 23:18:17,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:18:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2020-10-25 23:18:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1571. [2020-10-25 23:18:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-10-25 23:18:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2022 transitions. [2020-10-25 23:18:17,917 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2022 transitions. Word has length 134 [2020-10-25 23:18:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:17,917 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 2022 transitions. [2020-10-25 23:18:17,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:18:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2022 transitions. [2020-10-25 23:18:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-25 23:18:17,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:17,921 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:17,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-25 23:18:17,922 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash -394488639, now seen corresponding path program 1 times [2020-10-25 23:18:17,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:17,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717155343] [2020-10-25 23:18:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-25 23:18:18,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717155343] [2020-10-25 23:18:18,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:18,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:18:18,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005510818] [2020-10-25 23:18:18,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:18:18,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:18:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:18:18,071 INFO L87 Difference]: Start difference. First operand 1571 states and 2022 transitions. Second operand 6 states. [2020-10-25 23:18:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:19,524 INFO L93 Difference]: Finished difference Result 8054 states and 10587 transitions. [2020-10-25 23:18:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 23:18:19,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2020-10-25 23:18:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:19,535 INFO L225 Difference]: With dead ends: 8054 [2020-10-25 23:18:19,535 INFO L226 Difference]: Without dead ends: 6707 [2020-10-25 23:18:19,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:18:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2020-10-25 23:18:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 2052. [2020-10-25 23:18:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2020-10-25 23:18:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2592 transitions. [2020-10-25 23:18:20,055 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2592 transitions. Word has length 135 [2020-10-25 23:18:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:20,056 INFO L481 AbstractCegarLoop]: Abstraction has 2052 states and 2592 transitions. [2020-10-25 23:18:20,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:18:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2592 transitions. [2020-10-25 23:18:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-25 23:18:20,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:20,061 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:20,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-25 23:18:20,061 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1778086883, now seen corresponding path program 1 times [2020-10-25 23:18:20,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:20,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425664857] [2020-10-25 23:18:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:20,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425664857] [2020-10-25 23:18:20,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388988848] [2020-10-25 23:18:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:20,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-25 23:18:20,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:20,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:20,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-25 23:18:20,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768677241] [2020-10-25 23:18:20,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 23:18:20,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:20,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 23:18:20,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-25 23:18:20,570 INFO L87 Difference]: Start difference. First operand 2052 states and 2592 transitions. Second operand 16 states. [2020-10-25 23:18:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:23,008 INFO L93 Difference]: Finished difference Result 7487 states and 9524 transitions. [2020-10-25 23:18:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-25 23:18:23,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 135 [2020-10-25 23:18:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:23,014 INFO L225 Difference]: With dead ends: 7487 [2020-10-25 23:18:23,014 INFO L226 Difference]: Without dead ends: 5659 [2020-10-25 23:18:23,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2020-10-25 23:18:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2020-10-25 23:18:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 2611. [2020-10-25 23:18:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2020-10-25 23:18:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3304 transitions. [2020-10-25 23:18:23,463 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3304 transitions. Word has length 135 [2020-10-25 23:18:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:23,464 INFO L481 AbstractCegarLoop]: Abstraction has 2611 states and 3304 transitions. [2020-10-25 23:18:23,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 23:18:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3304 transitions. [2020-10-25 23:18:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-25 23:18:23,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:23,468 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:23,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-10-25 23:18:23,682 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1485839515, now seen corresponding path program 1 times [2020-10-25 23:18:23,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:23,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302413697] [2020-10-25 23:18:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-25 23:18:23,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302413697] [2020-10-25 23:18:23,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:23,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:18:23,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67988277] [2020-10-25 23:18:23,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:18:23,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:18:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:18:23,750 INFO L87 Difference]: Start difference. First operand 2611 states and 3304 transitions. Second operand 4 states. [2020-10-25 23:18:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:24,171 INFO L93 Difference]: Finished difference Result 4794 states and 6109 transitions. [2020-10-25 23:18:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:18:24,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-10-25 23:18:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:24,174 INFO L225 Difference]: With dead ends: 4794 [2020-10-25 23:18:24,174 INFO L226 Difference]: Without dead ends: 2360 [2020-10-25 23:18:24,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:18:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2020-10-25 23:18:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2352. [2020-10-25 23:18:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2020-10-25 23:18:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2971 transitions. [2020-10-25 23:18:24,595 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2971 transitions. Word has length 135 [2020-10-25 23:18:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:24,595 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 2971 transitions. [2020-10-25 23:18:24,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:18:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2971 transitions. [2020-10-25 23:18:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-25 23:18:24,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:24,599 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:24,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-25 23:18:24,599 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash -701730720, now seen corresponding path program 1 times [2020-10-25 23:18:24,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:24,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578648410] [2020-10-25 23:18:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:24,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578648410] [2020-10-25 23:18:24,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349066191] [2020-10-25 23:18:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:25,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 23:18:25,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:25,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 23:18:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:25,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:25,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-10-25 23:18:25,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215144841] [2020-10-25 23:18:25,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 23:18:25,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 23:18:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:18:25,275 INFO L87 Difference]: Start difference. First operand 2352 states and 2971 transitions. Second operand 15 states. [2020-10-25 23:18:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:27,188 INFO L93 Difference]: Finished difference Result 6338 states and 8056 transitions. [2020-10-25 23:18:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 23:18:27,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2020-10-25 23:18:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:27,192 INFO L225 Difference]: With dead ends: 6338 [2020-10-25 23:18:27,192 INFO L226 Difference]: Without dead ends: 4210 [2020-10-25 23:18:27,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2020-10-25 23:18:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2020-10-25 23:18:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 2428. [2020-10-25 23:18:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2020-10-25 23:18:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3078 transitions. [2020-10-25 23:18:27,645 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3078 transitions. Word has length 136 [2020-10-25 23:18:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:27,646 INFO L481 AbstractCegarLoop]: Abstraction has 2428 states and 3078 transitions. [2020-10-25 23:18:27,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 23:18:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3078 transitions. [2020-10-25 23:18:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-25 23:18:27,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:27,649 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:27,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-25 23:18:27,850 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash 57866394, now seen corresponding path program 1 times [2020-10-25 23:18:27,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:27,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765628096] [2020-10-25 23:18:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:28,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765628096] [2020-10-25 23:18:28,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069429364] [2020-10-25 23:18:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:28,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 23:18:28,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:28,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:28,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-25 23:18:28,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739565541] [2020-10-25 23:18:28,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 23:18:28,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 23:18:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:18:28,358 INFO L87 Difference]: Start difference. First operand 2428 states and 3078 transitions. Second operand 7 states. [2020-10-25 23:18:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:31,036 INFO L93 Difference]: Finished difference Result 12592 states and 16326 transitions. [2020-10-25 23:18:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 23:18:31,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-10-25 23:18:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:31,055 INFO L225 Difference]: With dead ends: 12592 [2020-10-25 23:18:31,055 INFO L226 Difference]: Without dead ends: 10388 [2020-10-25 23:18:31,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-10-25 23:18:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10388 states. [2020-10-25 23:18:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10388 to 3220. [2020-10-25 23:18:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2020-10-25 23:18:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4097 transitions. [2020-10-25 23:18:31,676 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4097 transitions. Word has length 136 [2020-10-25 23:18:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:31,676 INFO L481 AbstractCegarLoop]: Abstraction has 3220 states and 4097 transitions. [2020-10-25 23:18:31,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 23:18:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4097 transitions. [2020-10-25 23:18:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-25 23:18:31,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:31,680 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:31,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:31,881 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2128912830, now seen corresponding path program 1 times [2020-10-25 23:18:31,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:31,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861679575] [2020-10-25 23:18:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:32,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861679575] [2020-10-25 23:18:32,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238772349] [2020-10-25 23:18:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:32,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 23:18:32,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:32,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:18:32,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-25 23:18:32,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060143501] [2020-10-25 23:18:32,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 23:18:32,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:32,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 23:18:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:18:32,385 INFO L87 Difference]: Start difference. First operand 3220 states and 4097 transitions. Second operand 8 states. [2020-10-25 23:18:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:33,796 INFO L93 Difference]: Finished difference Result 8014 states and 10249 transitions. [2020-10-25 23:18:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 23:18:33,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-10-25 23:18:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:33,804 INFO L225 Difference]: With dead ends: 8014 [2020-10-25 23:18:33,804 INFO L226 Difference]: Without dead ends: 5018 [2020-10-25 23:18:33,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:18:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2020-10-25 23:18:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 3326. [2020-10-25 23:18:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2020-10-25 23:18:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4236 transitions. [2020-10-25 23:18:34,381 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4236 transitions. Word has length 136 [2020-10-25 23:18:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:34,381 INFO L481 AbstractCegarLoop]: Abstraction has 3326 states and 4236 transitions. [2020-10-25 23:18:34,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 23:18:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4236 transitions. [2020-10-25 23:18:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 23:18:34,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:34,384 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:34,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-10-25 23:18:34,586 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1363951242, now seen corresponding path program 1 times [2020-10-25 23:18:34,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:34,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559684522] [2020-10-25 23:18:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:34,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559684522] [2020-10-25 23:18:34,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073612695] [2020-10-25 23:18:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:34,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 23:18:34,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:34,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 23:18:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:35,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:18:35,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-10-25 23:18:35,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639571577] [2020-10-25 23:18:35,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 23:18:35,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:35,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 23:18:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:18:35,216 INFO L87 Difference]: Start difference. First operand 3326 states and 4236 transitions. Second operand 15 states. [2020-10-25 23:18:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:37,673 INFO L93 Difference]: Finished difference Result 8301 states and 10583 transitions. [2020-10-25 23:18:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-25 23:18:37,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2020-10-25 23:18:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:37,678 INFO L225 Difference]: With dead ends: 8301 [2020-10-25 23:18:37,679 INFO L226 Difference]: Without dead ends: 5199 [2020-10-25 23:18:37,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2020-10-25 23:18:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2020-10-25 23:18:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 3364. [2020-10-25 23:18:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2020-10-25 23:18:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4284 transitions. [2020-10-25 23:18:38,372 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4284 transitions. Word has length 137 [2020-10-25 23:18:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:38,372 INFO L481 AbstractCegarLoop]: Abstraction has 3364 states and 4284 transitions. [2020-10-25 23:18:38,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 23:18:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4284 transitions. [2020-10-25 23:18:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 23:18:38,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:38,376 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:38,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:38,580 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1734761688, now seen corresponding path program 1 times [2020-10-25 23:18:38,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:38,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472205188] [2020-10-25 23:18:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:38,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472205188] [2020-10-25 23:18:38,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266213387] [2020-10-25 23:18:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:38,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 23:18:38,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:39,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:18:39,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-25 23:18:39,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182843931] [2020-10-25 23:18:39,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 23:18:39,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 23:18:39,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:18:39,007 INFO L87 Difference]: Start difference. First operand 3364 states and 4284 transitions. Second operand 8 states. [2020-10-25 23:18:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:40,611 INFO L93 Difference]: Finished difference Result 8924 states and 11431 transitions. [2020-10-25 23:18:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 23:18:40,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2020-10-25 23:18:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:40,617 INFO L225 Difference]: With dead ends: 8924 [2020-10-25 23:18:40,617 INFO L226 Difference]: Without dead ends: 5784 [2020-10-25 23:18:40,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2020-10-25 23:18:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2020-10-25 23:18:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 3643. [2020-10-25 23:18:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2020-10-25 23:18:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4644 transitions. [2020-10-25 23:18:41,255 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4644 transitions. Word has length 137 [2020-10-25 23:18:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:41,255 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 4644 transitions. [2020-10-25 23:18:41,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 23:18:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4644 transitions. [2020-10-25 23:18:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 23:18:41,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:41,258 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:41,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:41,460 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1145607294, now seen corresponding path program 1 times [2020-10-25 23:18:41,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:41,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34659486] [2020-10-25 23:18:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:41,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34659486] [2020-10-25 23:18:41,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187017692] [2020-10-25 23:18:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:18:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:41,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 23:18:41,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:18:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:18:41,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:18:41,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-25 23:18:41,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333292] [2020-10-25 23:18:41,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 23:18:41,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:41,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 23:18:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:18:41,985 INFO L87 Difference]: Start difference. First operand 3643 states and 4644 transitions. Second operand 8 states. [2020-10-25 23:18:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:43,429 INFO L93 Difference]: Finished difference Result 8572 states and 10955 transitions. [2020-10-25 23:18:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-25 23:18:43,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2020-10-25 23:18:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:43,435 INFO L225 Difference]: With dead ends: 8572 [2020-10-25 23:18:43,435 INFO L226 Difference]: Without dead ends: 5153 [2020-10-25 23:18:43,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-10-25 23:18:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2020-10-25 23:18:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 3361. [2020-10-25 23:18:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-10-25 23:18:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4274 transitions. [2020-10-25 23:18:44,056 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4274 transitions. Word has length 137 [2020-10-25 23:18:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:44,056 INFO L481 AbstractCegarLoop]: Abstraction has 3361 states and 4274 transitions. [2020-10-25 23:18:44,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 23:18:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4274 transitions. [2020-10-25 23:18:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-10-25 23:18:44,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:44,058 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:44,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-10-25 23:18:44,264 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash 184921083, now seen corresponding path program 1 times [2020-10-25 23:18:44,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:44,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056502565] [2020-10-25 23:18:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:18:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 23:18:44,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056502565] [2020-10-25 23:18:44,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:18:44,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:18:44,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775707983] [2020-10-25 23:18:44,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:18:44,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:18:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:18:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:18:44,439 INFO L87 Difference]: Start difference. First operand 3361 states and 4274 transitions. Second operand 6 states. [2020-10-25 23:18:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:18:45,891 INFO L93 Difference]: Finished difference Result 8605 states and 11109 transitions. [2020-10-25 23:18:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 23:18:45,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2020-10-25 23:18:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:18:45,897 INFO L225 Difference]: With dead ends: 8605 [2020-10-25 23:18:45,897 INFO L226 Difference]: Without dead ends: 5450 [2020-10-25 23:18:45,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:18:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2020-10-25 23:18:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 3361. [2020-10-25 23:18:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-10-25 23:18:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4271 transitions. [2020-10-25 23:18:46,591 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4271 transitions. Word has length 138 [2020-10-25 23:18:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:18:46,592 INFO L481 AbstractCegarLoop]: Abstraction has 3361 states and 4271 transitions. [2020-10-25 23:18:46,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:18:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4271 transitions. [2020-10-25 23:18:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-10-25 23:18:46,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:18:46,594 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:18:46,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-25 23:18:46,595 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:18:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:18:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 583046840, now seen corresponding path program 1 times [2020-10-25 23:18:46,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:18:46,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79183039] [2020-10-25 23:18:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:18:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:18:46,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:18:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:18:46,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:18:46,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:18:46,840 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:18:46,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-25 23:18:47,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:18:47 BoogieIcfgContainer [2020-10-25 23:18:47,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:18:47,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:18:47,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:18:47,160 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:18:47,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:17:47" (3/4) ... [2020-10-25 23:18:47,164 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:18:47,470 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:18:47,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:18:47,472 INFO L168 Benchmark]: Toolchain (without parser) took 61787.34 ms. Allocated memory was 41.9 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 18.2 MB in the beginning and 963.2 MB in the end (delta: -945.1 MB). Peak memory consumption was 735.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,473 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 41.9 MB. Free memory was 28.6 MB in the beginning and 28.6 MB in the end (delta: 32.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:18:47,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.59 ms. Allocated memory is still 50.3 MB. Free memory was 34.9 MB in the beginning and 28.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.95 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 24.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,474 INFO L168 Benchmark]: Boogie Preprocessor took 72.81 ms. Allocated memory is still 50.3 MB. Free memory was 24.2 MB in the beginning and 20.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,475 INFO L168 Benchmark]: RCFGBuilder took 1550.74 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 20.4 MB in the beginning and 36.4 MB in the end (delta: -16.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,475 INFO L168 Benchmark]: TraceAbstraction took 59197.83 ms. Allocated memory was 60.8 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 36.0 MB in the beginning and 1.0 GB in the end (delta: -973.3 MB). Peak memory consumption was 686.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,476 INFO L168 Benchmark]: Witness Printer took 310.37 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 963.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:18:47,479 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.33 ms. Allocated memory is still 41.9 MB. Free memory was 28.6 MB in the beginning and 28.6 MB in the end (delta: 32.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 507.59 ms. Allocated memory is still 50.3 MB. Free memory was 34.9 MB in the beginning and 28.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.95 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 24.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.81 ms. Allocated memory is still 50.3 MB. Free memory was 24.2 MB in the beginning and 20.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1550.74 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 20.4 MB in the beginning and 36.4 MB in the end (delta: -16.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 59197.83 ms. Allocated memory was 60.8 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 36.0 MB in the beginning and 1.0 GB in the end (delta: -973.3 MB). Peak memory consumption was 686.1 MB. Max. memory is 16.1 GB. * Witness Printer took 310.37 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 963.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] msg_t nomsg = (msg_t )-1; [L72] port_t cs1 ; [L73] int8_t cs1_old ; [L74] int8_t cs1_new ; [L75] port_t cs2 ; [L76] int8_t cs2_old ; [L77] int8_t cs2_new ; [L78] port_t s1s2 ; [L79] int8_t s1s2_old ; [L80] int8_t s1s2_new ; [L81] port_t s1s1 ; [L82] int8_t s1s1_old ; [L83] int8_t s1s1_new ; [L84] port_t s2s1 ; [L85] int8_t s2s1_old ; [L86] int8_t s2s1_new ; [L87] port_t s2s2 ; [L88] int8_t s2s2_old ; [L89] int8_t s2s2_new ; [L90] port_t s1p ; [L91] int8_t s1p_old ; [L92] int8_t s1p_new ; [L93] port_t s2p ; [L94] int8_t s2p_old ; [L95] int8_t s2p_new ; [L98] _Bool side1Failed ; [L99] _Bool side2Failed ; [L100] msg_t side1_written ; [L101] msg_t side2_written ; [L107] static _Bool side1Failed_History_0 ; [L108] static _Bool side1Failed_History_1 ; [L109] static _Bool side1Failed_History_2 ; [L110] static _Bool side2Failed_History_0 ; [L111] static _Bool side2Failed_History_1 ; [L112] static _Bool side2Failed_History_2 ; [L113] static int8_t active_side_History_0 ; [L114] static int8_t active_side_History_1 ; [L115] static int8_t active_side_History_2 ; [L116] static msg_t manual_selection_History_0 ; [L117] static msg_t manual_selection_History_1 ; [L118] static msg_t manual_selection_History_2 ; [L460] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; 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] [L582] int c1 ; [L583] int i2 ; [L586] c1 = 0 [L587] side1Failed = __VERIFIER_nondet_bool() [L588] side2Failed = __VERIFIER_nondet_bool() [L589] side1_written = __VERIFIER_nondet_char() [L590] side2_written = __VERIFIER_nondet_char() [L591] side1Failed_History_0 = __VERIFIER_nondet_bool() [L592] side1Failed_History_1 = __VERIFIER_nondet_bool() [L593] side1Failed_History_2 = __VERIFIER_nondet_bool() [L594] side2Failed_History_0 = __VERIFIER_nondet_bool() [L595] side2Failed_History_1 = __VERIFIER_nondet_bool() [L596] side2Failed_History_2 = __VERIFIER_nondet_bool() [L597] active_side_History_0 = __VERIFIER_nondet_char() [L598] active_side_History_1 = __VERIFIER_nondet_char() [L599] active_side_History_2 = __VERIFIER_nondet_char() [L600] manual_selection_History_0 = __VERIFIER_nondet_char() [L601] manual_selection_History_1 = __VERIFIER_nondet_char() [L602] manual_selection_History_2 = __VERIFIER_nondet_char() [L244] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L247] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L250] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L253] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L256] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L262] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L265] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L268] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L271] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L274] 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !((int )manual_selection_History_2 != 0) [L280] return (1); 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L603] i2 = init() [L105] COND FALSE !(!cond) 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] cs1_old = nomsg [L606] cs1_new = nomsg [L607] cs2_old = nomsg [L608] cs2_new = nomsg [L609] s1s2_old = nomsg [L610] s1s2_new = nomsg [L611] s1s1_old = nomsg [L612] s1s1_new = nomsg [L613] s2s1_old = nomsg [L614] s2s1_new = nomsg [L615] s2s2_old = nomsg [L616] s2s2_new = nomsg [L617] s1p_old = nomsg [L618] s1p_new = nomsg [L619] s2p_old = nomsg [L620] s2p_new = nomsg [L621] i2 = 0 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_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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L622] COND TRUE i2 < 10 [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] manual_selection = tmp [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] manual_selection_History_0 = val 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_History_0=-2, 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L305] 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_History_0=-2, 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-2, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-2, 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L324] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L325] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L325] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L326] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L326] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L327] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L327] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L328] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L381] COND FALSE !(\read(side2Failed)) [L388] side1 = s1s2_old [L389] s1s2_old = nomsg [L390] side2 = s2s2_old [L391] s2s2_old = nomsg [L392] manual_selection = cs2_old [L393] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND TRUE (int )side1 == (int )side2 [L395] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L419] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=0, 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L419] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L420] 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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=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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L420] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L421] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] int8_t side2 ; [L195] COND TRUE (int )index == 0 [L196] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L441] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L444] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L447] COND FALSE !((int )side1 == 0) [L454] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, 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] [L628] cs1_old = cs1_new [L629] cs1_new = nomsg [L630] cs2_old = cs2_new [L631] cs2_new = nomsg [L632] s1s2_old = s1s2_new [L633] s1s2_new = nomsg [L634] s1s1_old = s1s1_new [L635] s1s1_new = nomsg [L636] s2s1_old = s2s1_new [L637] s2s1_new = nomsg [L638] s2s2_old = s2s2_new [L639] s2s2_new = nomsg [L640] s1p_old = s1p_new [L641] s1p_new = nomsg [L642] s2p_old = s2p_new [L643] s2p_new = nomsg [L463] int tmp ; [L464] msg_t tmp___0 ; [L465] _Bool tmp___1 ; [L466] _Bool tmp___2 ; [L467] _Bool tmp___3 ; [L468] _Bool tmp___4 ; [L469] int8_t tmp___5 ; [L470] _Bool tmp___6 ; [L471] _Bool tmp___7 ; [L472] _Bool tmp___8 ; [L473] int8_t tmp___9 ; [L474] _Bool tmp___10 ; [L475] _Bool tmp___11 ; [L476] _Bool tmp___12 ; [L477] msg_t tmp___13 ; [L478] _Bool tmp___14 ; [L479] _Bool tmp___15 ; [L480] _Bool tmp___16 ; [L481] _Bool tmp___17 ; [L482] int8_t tmp___18 ; [L483] int8_t tmp___19 ; [L484] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L487] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L490] COND TRUE ! side2Failed [L491] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L105] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L225] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L228] COND TRUE (int )index == 1 [L229] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] tmp___0 = read_manual_selection_history((unsigned char)1) [L497] COND TRUE ! tmp___0 [L135] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L138] COND TRUE (int )index == 1 [L139] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L498] tmp___1 = read_side1_failed_history((unsigned char)1) [L499] COND TRUE ! tmp___1 [L135] COND TRUE (int )index == 0 [L136] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L500] tmp___2 = read_side1_failed_history((unsigned char)0) [L501] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L135] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L138] COND TRUE (int )index == 1 [L139] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L526] tmp___7 = read_side1_failed_history((unsigned char)1) [L527] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L135] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L138] COND TRUE (int )index == 1 [L139] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L542] tmp___11 = read_side1_failed_history((unsigned char)1) [L543] COND TRUE ! tmp___11 [L165] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L168] COND TRUE (int )index == 1 [L169] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L544] tmp___12 = read_side2_failed_history((unsigned char)1) [L545] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L195] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L198] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L201] COND TRUE (int )index == 2 [L202] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L558] tmp___20 = read_active_side_history((unsigned char)2) [L559] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L577] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L644] c1 = check() [L657] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L646] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, 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] [L622] COND TRUE i2 < 10 [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] manual_selection = tmp [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] manual_selection_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L305] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-2, cs2=0, cs2_new=-128, cs2_old=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-2, cs2=0, cs2_new=-128, cs2_old=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L324] COND FALSE !(\read(side1Failed)) [L331] side1 = s1s1_old [L332] s1s1_old = nomsg [L333] side2 = s2s1_old [L334] s2s1_old = nomsg [L335] manual_selection = cs1_old [L336] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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_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] [L337] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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_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] [L340] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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_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] [L341] COND TRUE (int )side2 != (int )nomsg [L342] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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_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] [L361] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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_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] [L361] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L362] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, manual_selection_History_2=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_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] [L362] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L363] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, manual_selection_History_2=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_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] [L363] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L364] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] side2Failed_History_0 = val 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L381] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L382] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L382] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L383] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L383] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L384] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L384] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L385] 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] int8_t side2 ; [L195] COND TRUE (int )index == 0 [L196] return (active_side_History_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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] s2p_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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L441] COND FALSE !((int )side1 == 1) 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L444] COND FALSE !((int )side2 == 1) 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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L447] COND FALSE !((int )side1 == 0) [L454] active_side = (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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] active_side_History_0 = val VAL [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=-2, manual_selection_History_0=-128, manual_selection_History_1=-2, 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] [L628] cs1_old = cs1_new [L629] cs1_new = nomsg [L630] cs2_old = cs2_new [L631] cs2_new = nomsg [L632] s1s2_old = s1s2_new [L633] s1s2_new = nomsg [L634] s1s1_old = s1s1_new [L635] s1s1_new = nomsg [L636] s2s1_old = s2s1_new [L637] s2s1_new = nomsg [L638] s2s2_old = s2s2_new [L639] s2s2_new = nomsg [L640] s1p_old = s1p_new [L641] s1p_new = nomsg [L642] s2p_old = s2p_new [L643] s2p_new = nomsg [L463] int tmp ; [L464] msg_t tmp___0 ; [L465] _Bool tmp___1 ; [L466] _Bool tmp___2 ; [L467] _Bool tmp___3 ; [L468] _Bool tmp___4 ; [L469] int8_t tmp___5 ; [L470] _Bool tmp___6 ; [L471] _Bool tmp___7 ; [L472] _Bool tmp___8 ; [L473] int8_t tmp___9 ; [L474] _Bool tmp___10 ; [L475] _Bool tmp___11 ; [L476] _Bool tmp___12 ; [L477] msg_t tmp___13 ; [L478] _Bool tmp___14 ; [L479] _Bool tmp___15 ; [L480] _Bool tmp___16 ; [L481] _Bool tmp___17 ; [L482] int8_t tmp___18 ; [L483] int8_t tmp___19 ; [L484] 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=-2, 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] [L487] COND TRUE ! side1Failed [L488] 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=-2, 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] [L105] COND FALSE !(!cond) 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=-2, 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] [L225] COND FALSE !((int )index == 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=-2, 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] [L228] COND TRUE (int )index == 1 [L229] return (manual_selection_History_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=-2, 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] [L496] tmp___0 = read_manual_selection_history((unsigned char)1) [L497] 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=-2, 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] [L135] COND FALSE !((int )index == 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=-2, 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] [L138] COND TRUE (int )index == 1 [L139] return (side1Failed_History_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=-2, 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] [L526] tmp___7 = read_side1_failed_history((unsigned char)1) [L527] COND TRUE \read(tmp___7) [L165] COND FALSE !((int )index == 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=-2, 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] [L168] COND TRUE (int )index == 1 [L169] return (side2Failed_History_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=-2, 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] [L528] tmp___8 = read_side2_failed_history((unsigned char)1) [L529] COND TRUE ! tmp___8 [L195] COND TRUE (int )index == 0 [L196] return (active_side_History_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=-2, 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] [L530] tmp___5 = read_active_side_history((unsigned char)0) [L531] COND TRUE ! ((int )tmp___5 == 2) [L532] return (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=-2, 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] [L644] c1 = check() [L657] COND TRUE ! arg 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=-2, 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] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c", 3, "reach_error") 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=-2, 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 1 procedures, 318 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 58.8s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22306 SDtfs, 35262 SDslu, 73779 SDs, 0 SdLazy, 12318 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2030 GetRequests, 1555 SyntacticMatches, 15 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3643occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 44178 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 5934 NumberOfCodeBlocks, 5934 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5735 ConstructedInterpolants, 77 QuantifiedInterpolants, 3514944 SizeOfPredicates, 44 NumberOfNonLiveVariables, 8756 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 57 InterpolantComputations, 39 PerfectInterpolantSequences, 835/1063 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! Received shutdown request...