./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb3a4b195c75cf03f04a5fbe6f3aca380cce8e4d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-0ed9222-m [2019-01-12 17:55:33,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 17:55:33,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 17:55:33,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 17:55:33,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 17:55:33,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 17:55:33,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 17:55:33,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 17:55:33,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 17:55:33,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 17:55:33,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 17:55:33,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 17:55:33,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 17:55:33,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 17:55:33,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 17:55:33,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 17:55:33,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 17:55:33,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 17:55:33,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 17:55:33,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 17:55:33,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 17:55:33,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 17:55:33,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 17:55:33,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 17:55:33,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 17:55:33,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 17:55:33,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 17:55:33,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 17:55:33,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 17:55:33,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 17:55:33,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 17:55:33,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 17:55:33,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 17:55:33,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 17:55:33,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 17:55:33,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 17:55:33,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 17:55:33,839 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 17:55:33,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 17:55:33,840 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 17:55:33,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 17:55:33,841 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 17:55:33,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 17:55:33,841 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 17:55:33,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 17:55:33,841 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 17:55:33,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 17:55:33,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 17:55:33,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 17:55:33,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 17:55:33,843 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 17:55:33,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 17:55:33,843 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 17:55:33,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 17:55:33,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 17:55:33,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 17:55:33,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 17:55:33,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 17:55:33,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:33,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 17:55:33,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 17:55:33,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 17:55:33,846 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 17:55:33,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 17:55:33,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 17:55:33,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_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 -> fb3a4b195c75cf03f04a5fbe6f3aca380cce8e4d [2019-01-12 17:55:33,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 17:55:33,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 17:55:33,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 17:55:33,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 17:55:33,899 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 17:55:33,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 17:55:33,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9452be80/3fbec55a1fa34c609d80059b92facbbc/FLAGf0647bad0 [2019-01-12 17:55:34,435 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 17:55:34,436 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 17:55:34,450 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9452be80/3fbec55a1fa34c609d80059b92facbbc/FLAGf0647bad0 [2019-01-12 17:55:34,926 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9452be80/3fbec55a1fa34c609d80059b92facbbc [2019-01-12 17:55:34,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 17:55:34,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 17:55:34,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:34,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 17:55:34,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 17:55:34,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:34" (1/1) ... [2019-01-12 17:55:34,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8cb670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:34, skipping insertion in model container [2019-01-12 17:55:34,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:34" (1/1) ... [2019-01-12 17:55:34,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 17:55:35,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 17:55:35,432 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:35,448 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 17:55:35,665 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:35,692 INFO L195 MainTranslator]: Completed translation [2019-01-12 17:55:35,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35 WrapperNode [2019-01-12 17:55:35,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:35,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:35,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 17:55:35,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 17:55:35,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:35,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 17:55:35,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 17:55:35,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 17:55:35,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (1/1) ... [2019-01-12 17:55:35,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 17:55:35,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 17:55:35,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 17:55:35,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 17:55:35,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (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 [2019-01-12 17:55:35,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 17:55:35,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 17:55:37,918 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 17:55:37,918 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 17:55:37,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:37 BoogieIcfgContainer [2019-01-12 17:55:37,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 17:55:37,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 17:55:37,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 17:55:37,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 17:55:37,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:55:34" (1/3) ... [2019-01-12 17:55:37,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e26245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:37, skipping insertion in model container [2019-01-12 17:55:37,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:35" (2/3) ... [2019-01-12 17:55:37,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e26245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:37, skipping insertion in model container [2019-01-12 17:55:37,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:37" (3/3) ... [2019-01-12 17:55:37,927 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 17:55:37,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 17:55:37,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 17:55:37,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 17:55:37,995 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 17:55:37,996 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 17:55:37,996 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 17:55:37,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 17:55:37,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 17:55:37,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 17:55:37,997 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 17:55:37,997 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 17:55:37,997 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 17:55:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 17:55:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 17:55:38,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:38,033 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:38,035 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:38,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1484652330, now seen corresponding path program 1 times [2019-01-12 17:55:38,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:38,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:38,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:38,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:38,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:38,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:38,726 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-01-12 17:55:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:39,041 INFO L93 Difference]: Finished difference Result 709 states and 1262 transitions. [2019-01-12 17:55:39,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:39,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 17:55:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:39,082 INFO L225 Difference]: With dead ends: 709 [2019-01-12 17:55:39,083 INFO L226 Difference]: Without dead ends: 467 [2019-01-12 17:55:39,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-01-12 17:55:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 446. [2019-01-12 17:55:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-12 17:55:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 650 transitions. [2019-01-12 17:55:39,236 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 650 transitions. Word has length 92 [2019-01-12 17:55:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:39,236 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 650 transitions. [2019-01-12 17:55:39,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2019-01-12 17:55:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 17:55:39,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:39,242 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:39,243 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1677829578, now seen corresponding path program 1 times [2019-01-12 17:55:39,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:39,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:39,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:39,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:39,341 INFO L87 Difference]: Start difference. First operand 446 states and 650 transitions. Second operand 3 states. [2019-01-12 17:55:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:39,446 INFO L93 Difference]: Finished difference Result 1300 states and 1888 transitions. [2019-01-12 17:55:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:39,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-12 17:55:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:39,456 INFO L225 Difference]: With dead ends: 1300 [2019-01-12 17:55:39,456 INFO L226 Difference]: Without dead ends: 882 [2019-01-12 17:55:39,463 INFO L631 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 [2019-01-12 17:55:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-01-12 17:55:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 448. [2019-01-12 17:55:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-12 17:55:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 652 transitions. [2019-01-12 17:55:39,528 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 652 transitions. Word has length 93 [2019-01-12 17:55:39,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:39,529 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 652 transitions. [2019-01-12 17:55:39,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 652 transitions. [2019-01-12 17:55:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 17:55:39,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:39,535 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:39,535 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 888900743, now seen corresponding path program 1 times [2019-01-12 17:55:39,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:39,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:39,742 INFO L87 Difference]: Start difference. First operand 448 states and 652 transitions. Second operand 3 states. [2019-01-12 17:55:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:39,997 INFO L93 Difference]: Finished difference Result 1137 states and 1669 transitions. [2019-01-12 17:55:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:39,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 17:55:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:40,004 INFO L225 Difference]: With dead ends: 1137 [2019-01-12 17:55:40,004 INFO L226 Difference]: Without dead ends: 865 [2019-01-12 17:55:40,005 INFO L631 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 [2019-01-12 17:55:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-01-12 17:55:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 846. [2019-01-12 17:55:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-01-12 17:55:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1226 transitions. [2019-01-12 17:55:40,070 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1226 transitions. Word has length 94 [2019-01-12 17:55:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:40,071 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1226 transitions. [2019-01-12 17:55:40,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1226 transitions. [2019-01-12 17:55:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 17:55:40,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:40,078 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:40,078 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -590471708, now seen corresponding path program 1 times [2019-01-12 17:55:40,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:40,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:40,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:40,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:40,340 INFO L87 Difference]: Start difference. First operand 846 states and 1226 transitions. Second operand 4 states. [2019-01-12 17:55:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:40,589 INFO L93 Difference]: Finished difference Result 1330 states and 1941 transitions. [2019-01-12 17:55:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:40,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 17:55:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:40,593 INFO L225 Difference]: With dead ends: 1330 [2019-01-12 17:55:40,593 INFO L226 Difference]: Without dead ends: 650 [2019-01-12 17:55:40,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-01-12 17:55:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-01-12 17:55:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-01-12 17:55:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 936 transitions. [2019-01-12 17:55:40,642 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 936 transitions. Word has length 94 [2019-01-12 17:55:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:40,643 INFO L480 AbstractCegarLoop]: Abstraction has 650 states and 936 transitions. [2019-01-12 17:55:40,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 936 transitions. [2019-01-12 17:55:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 17:55:40,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:40,677 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:40,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -302740898, now seen corresponding path program 1 times [2019-01-12 17:55:40,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:40,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:41,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:41,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:41,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:41,049 INFO L87 Difference]: Start difference. First operand 650 states and 936 transitions. Second operand 4 states. [2019-01-12 17:55:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:41,665 INFO L93 Difference]: Finished difference Result 1603 states and 2304 transitions. [2019-01-12 17:55:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:41,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 17:55:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:41,671 INFO L225 Difference]: With dead ends: 1603 [2019-01-12 17:55:41,672 INFO L226 Difference]: Without dead ends: 972 [2019-01-12 17:55:41,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-01-12 17:55:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 958. [2019-01-12 17:55:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-01-12 17:55:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1367 transitions. [2019-01-12 17:55:41,748 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1367 transitions. Word has length 96 [2019-01-12 17:55:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:41,749 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1367 transitions. [2019-01-12 17:55:41,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1367 transitions. [2019-01-12 17:55:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 17:55:41,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:41,752 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:41,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1934612225, now seen corresponding path program 1 times [2019-01-12 17:55:41,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:41,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:41,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:41,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:41,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:41,868 INFO L87 Difference]: Start difference. First operand 958 states and 1367 transitions. Second operand 3 states. [2019-01-12 17:55:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:42,320 INFO L93 Difference]: Finished difference Result 2372 states and 3444 transitions. [2019-01-12 17:55:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:42,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-12 17:55:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:42,332 INFO L225 Difference]: With dead ends: 2372 [2019-01-12 17:55:42,332 INFO L226 Difference]: Without dead ends: 1738 [2019-01-12 17:55:42,333 INFO L631 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 [2019-01-12 17:55:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-01-12 17:55:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1726. [2019-01-12 17:55:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-12 17:55:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2465 transitions. [2019-01-12 17:55:42,469 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2465 transitions. Word has length 98 [2019-01-12 17:55:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2465 transitions. [2019-01-12 17:55:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2465 transitions. [2019-01-12 17:55:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 17:55:42,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:42,474 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:42,474 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1891861790, now seen corresponding path program 1 times [2019-01-12 17:55:42,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:42,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:42,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:42,683 INFO L87 Difference]: Start difference. First operand 1726 states and 2465 transitions. Second operand 4 states. [2019-01-12 17:55:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:42,914 INFO L93 Difference]: Finished difference Result 2601 states and 3737 transitions. [2019-01-12 17:55:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 17:55:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:42,923 INFO L225 Difference]: With dead ends: 2601 [2019-01-12 17:55:42,923 INFO L226 Difference]: Without dead ends: 1416 [2019-01-12 17:55:42,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-01-12 17:55:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2019-01-12 17:55:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-01-12 17:55:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2012 transitions. [2019-01-12 17:55:43,030 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2012 transitions. Word has length 98 [2019-01-12 17:55:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:43,030 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2012 transitions. [2019-01-12 17:55:43,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2012 transitions. [2019-01-12 17:55:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 17:55:43,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:43,035 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:43,035 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash -397488696, now seen corresponding path program 1 times [2019-01-12 17:55:43,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:43,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:43,143 INFO L87 Difference]: Start difference. First operand 1416 states and 2012 transitions. Second operand 3 states. [2019-01-12 17:55:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:45,097 INFO L93 Difference]: Finished difference Result 3485 states and 5081 transitions. [2019-01-12 17:55:45,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:45,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 17:55:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:45,111 INFO L225 Difference]: With dead ends: 3485 [2019-01-12 17:55:45,111 INFO L226 Difference]: Without dead ends: 2579 [2019-01-12 17:55:45,113 INFO L631 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 [2019-01-12 17:55:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2019-01-12 17:55:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2511. [2019-01-12 17:55:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2019-01-12 17:55:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3606 transitions. [2019-01-12 17:55:45,352 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3606 transitions. Word has length 100 [2019-01-12 17:55:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:45,353 INFO L480 AbstractCegarLoop]: Abstraction has 2511 states and 3606 transitions. [2019-01-12 17:55:45,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3606 transitions. [2019-01-12 17:55:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 17:55:45,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:45,360 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:45,360 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 814612451, now seen corresponding path program 1 times [2019-01-12 17:55:45,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:45,690 INFO L87 Difference]: Start difference. First operand 2511 states and 3606 transitions. Second operand 4 states. [2019-01-12 17:55:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:46,576 INFO L93 Difference]: Finished difference Result 7284 states and 10445 transitions. [2019-01-12 17:55:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:46,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 17:55:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:46,599 INFO L225 Difference]: With dead ends: 7284 [2019-01-12 17:55:46,599 INFO L226 Difference]: Without dead ends: 4812 [2019-01-12 17:55:46,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2019-01-12 17:55:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4744. [2019-01-12 17:55:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4744 states. [2019-01-12 17:55:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4744 states to 4744 states and 6749 transitions. [2019-01-12 17:55:46,916 INFO L78 Accepts]: Start accepts. Automaton has 4744 states and 6749 transitions. Word has length 100 [2019-01-12 17:55:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:46,916 INFO L480 AbstractCegarLoop]: Abstraction has 4744 states and 6749 transitions. [2019-01-12 17:55:46,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4744 states and 6749 transitions. [2019-01-12 17:55:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 17:55:46,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:46,922 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:46,922 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1949770599, now seen corresponding path program 1 times [2019-01-12 17:55:46,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:46,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:46,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:46,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:46,990 INFO L87 Difference]: Start difference. First operand 4744 states and 6749 transitions. Second operand 3 states. [2019-01-12 17:55:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:47,708 INFO L93 Difference]: Finished difference Result 14042 states and 20000 transitions. [2019-01-12 17:55:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:47,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 17:55:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:47,756 INFO L225 Difference]: With dead ends: 14042 [2019-01-12 17:55:47,756 INFO L226 Difference]: Without dead ends: 9402 [2019-01-12 17:55:47,764 INFO L631 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 [2019-01-12 17:55:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2019-01-12 17:55:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 4750. [2019-01-12 17:55:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-01-12 17:55:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 6755 transitions. [2019-01-12 17:55:48,232 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 6755 transitions. Word has length 101 [2019-01-12 17:55:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:48,232 INFO L480 AbstractCegarLoop]: Abstraction has 4750 states and 6755 transitions. [2019-01-12 17:55:48,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 6755 transitions. [2019-01-12 17:55:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 17:55:48,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:48,240 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:48,241 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1867198180, now seen corresponding path program 1 times [2019-01-12 17:55:48,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:48,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:48,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:48,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:48,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:48,425 INFO L87 Difference]: Start difference. First operand 4750 states and 6755 transitions. Second operand 4 states. [2019-01-12 17:55:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:48,736 INFO L93 Difference]: Finished difference Result 9462 states and 13458 transitions. [2019-01-12 17:55:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:48,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-12 17:55:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:48,755 INFO L225 Difference]: With dead ends: 9462 [2019-01-12 17:55:48,755 INFO L226 Difference]: Without dead ends: 4744 [2019-01-12 17:55:48,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2019-01-12 17:55:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4744. [2019-01-12 17:55:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4744 states. [2019-01-12 17:55:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4744 states to 4744 states and 6743 transitions. [2019-01-12 17:55:49,112 INFO L78 Accepts]: Start accepts. Automaton has 4744 states and 6743 transitions. Word has length 102 [2019-01-12 17:55:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 4744 states and 6743 transitions. [2019-01-12 17:55:49,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4744 states and 6743 transitions. [2019-01-12 17:55:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 17:55:49,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:49,119 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:49,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash -339506056, now seen corresponding path program 1 times [2019-01-12 17:55:49,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:49,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:49,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:49,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:49,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:49,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:49,232 INFO L87 Difference]: Start difference. First operand 4744 states and 6743 transitions. Second operand 3 states. [2019-01-12 17:55:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:49,630 INFO L93 Difference]: Finished difference Result 10887 states and 15567 transitions. [2019-01-12 17:55:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:49,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 17:55:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:49,643 INFO L225 Difference]: With dead ends: 10887 [2019-01-12 17:55:49,643 INFO L226 Difference]: Without dead ends: 7071 [2019-01-12 17:55:49,651 INFO L631 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 [2019-01-12 17:55:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2019-01-12 17:55:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7003. [2019-01-12 17:55:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7003 states. [2019-01-12 17:55:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 9785 transitions. [2019-01-12 17:55:50,193 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 9785 transitions. Word has length 102 [2019-01-12 17:55:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:50,193 INFO L480 AbstractCegarLoop]: Abstraction has 7003 states and 9785 transitions. [2019-01-12 17:55:50,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 9785 transitions. [2019-01-12 17:55:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:50,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:50,202 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:50,202 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:50,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1912112318, now seen corresponding path program 1 times [2019-01-12 17:55:50,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:50,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:50,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:50,450 INFO L87 Difference]: Start difference. First operand 7003 states and 9785 transitions. Second operand 5 states. [2019-01-12 17:55:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:51,219 INFO L93 Difference]: Finished difference Result 12346 states and 17403 transitions. [2019-01-12 17:55:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:55:51,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-01-12 17:55:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:51,232 INFO L225 Difference]: With dead ends: 12346 [2019-01-12 17:55:51,233 INFO L226 Difference]: Without dead ends: 7003 [2019-01-12 17:55:51,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:55:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7003 states. [2019-01-12 17:55:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7003 to 7003. [2019-01-12 17:55:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7003 states. [2019-01-12 17:55:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 9679 transitions. [2019-01-12 17:55:51,766 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 9679 transitions. Word has length 104 [2019-01-12 17:55:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:51,767 INFO L480 AbstractCegarLoop]: Abstraction has 7003 states and 9679 transitions. [2019-01-12 17:55:51,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 9679 transitions. [2019-01-12 17:55:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:51,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:51,774 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:51,774 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -53396381, now seen corresponding path program 1 times [2019-01-12 17:55:51,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:51,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:51,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:51,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:51,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:51,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:55:51,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:51,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:51,991 INFO L87 Difference]: Start difference. First operand 7003 states and 9679 transitions. Second operand 5 states. [2019-01-12 17:55:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:52,919 INFO L93 Difference]: Finished difference Result 10583 states and 15298 transitions. [2019-01-12 17:55:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:52,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-01-12 17:55:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:52,930 INFO L225 Difference]: With dead ends: 10583 [2019-01-12 17:55:52,930 INFO L226 Difference]: Without dead ends: 7075 [2019-01-12 17:55:52,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 17:55:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2019-01-12 17:55:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7075. [2019-01-12 17:55:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7075 states. [2019-01-12 17:55:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7075 states to 7075 states and 9719 transitions. [2019-01-12 17:55:53,427 INFO L78 Accepts]: Start accepts. Automaton has 7075 states and 9719 transitions. Word has length 104 [2019-01-12 17:55:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 7075 states and 9719 transitions. [2019-01-12 17:55:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7075 states and 9719 transitions. [2019-01-12 17:55:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:53,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:53,435 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:53,435 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2138796541, now seen corresponding path program 1 times [2019-01-12 17:55:53,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:53,728 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 17:55:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:53,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:53,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:53,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:53,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:53,756 INFO L87 Difference]: Start difference. First operand 7075 states and 9719 transitions. Second operand 4 states. [2019-01-12 17:55:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:54,548 INFO L93 Difference]: Finished difference Result 13151 states and 18070 transitions. [2019-01-12 17:55:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:54,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-01-12 17:55:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:54,559 INFO L225 Difference]: With dead ends: 13151 [2019-01-12 17:55:54,559 INFO L226 Difference]: Without dead ends: 6425 [2019-01-12 17:55:54,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6425 states. [2019-01-12 17:55:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6425 to 6346. [2019-01-12 17:55:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6346 states. [2019-01-12 17:55:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 8657 transitions. [2019-01-12 17:55:55,065 INFO L78 Accepts]: Start accepts. Automaton has 6346 states and 8657 transitions. Word has length 104 [2019-01-12 17:55:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:55,065 INFO L480 AbstractCegarLoop]: Abstraction has 6346 states and 8657 transitions. [2019-01-12 17:55:55,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6346 states and 8657 transitions. [2019-01-12 17:55:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 17:55:55,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:55,069 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:55,070 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash -589430877, now seen corresponding path program 1 times [2019-01-12 17:55:55,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:55,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:55,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:55,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:55,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:55,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:55,356 INFO L87 Difference]: Start difference. First operand 6346 states and 8657 transitions. Second operand 4 states. [2019-01-12 17:55:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:56,250 INFO L93 Difference]: Finished difference Result 12859 states and 17516 transitions. [2019-01-12 17:55:56,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:56,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-01-12 17:55:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:56,257 INFO L225 Difference]: With dead ends: 12859 [2019-01-12 17:55:56,257 INFO L226 Difference]: Without dead ends: 6662 [2019-01-12 17:55:56,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-01-12 17:55:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6490. [2019-01-12 17:55:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-01-12 17:55:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 8810 transitions. [2019-01-12 17:55:56,763 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 8810 transitions. Word has length 106 [2019-01-12 17:55:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:56,763 INFO L480 AbstractCegarLoop]: Abstraction has 6490 states and 8810 transitions. [2019-01-12 17:55:56,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 8810 transitions. [2019-01-12 17:55:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 17:55:56,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:56,768 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:56,768 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 18775605, now seen corresponding path program 1 times [2019-01-12 17:55:56,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:56,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:56,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:56,846 INFO L87 Difference]: Start difference. First operand 6490 states and 8810 transitions. Second operand 3 states. [2019-01-12 17:55:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:57,791 INFO L93 Difference]: Finished difference Result 17166 states and 23462 transitions. [2019-01-12 17:55:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:57,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-01-12 17:55:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:57,810 INFO L225 Difference]: With dead ends: 17166 [2019-01-12 17:55:57,810 INFO L226 Difference]: Without dead ends: 12782 [2019-01-12 17:55:57,819 INFO L631 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 [2019-01-12 17:55:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2019-01-12 17:55:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 6500. [2019-01-12 17:55:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6500 states. [2019-01-12 17:55:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 8820 transitions. [2019-01-12 17:55:58,462 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 8820 transitions. Word has length 107 [2019-01-12 17:55:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:58,462 INFO L480 AbstractCegarLoop]: Abstraction has 6500 states and 8820 transitions. [2019-01-12 17:55:58,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 8820 transitions. [2019-01-12 17:55:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 17:55:58,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:58,466 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:58,467 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1454455021, now seen corresponding path program 1 times [2019-01-12 17:55:58,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:58,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:58,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:58,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:58,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:58,652 INFO L87 Difference]: Start difference. First operand 6500 states and 8820 transitions. Second operand 4 states. [2019-01-12 17:55:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:59,238 INFO L93 Difference]: Finished difference Result 13251 states and 17925 transitions. [2019-01-12 17:55:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:59,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 17:55:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:59,246 INFO L225 Difference]: With dead ends: 13251 [2019-01-12 17:55:59,246 INFO L226 Difference]: Without dead ends: 7072 [2019-01-12 17:55:59,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2019-01-12 17:55:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 6788. [2019-01-12 17:55:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6788 states. [2019-01-12 17:55:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6788 states to 6788 states and 9127 transitions. [2019-01-12 17:55:59,873 INFO L78 Accepts]: Start accepts. Automaton has 6788 states and 9127 transitions. Word has length 108 [2019-01-12 17:55:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:59,873 INFO L480 AbstractCegarLoop]: Abstraction has 6788 states and 9127 transitions. [2019-01-12 17:55:59,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6788 states and 9127 transitions. [2019-01-12 17:55:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 17:55:59,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:59,878 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:55:59,878 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash -273511900, now seen corresponding path program 1 times [2019-01-12 17:55:59,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:59,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:59,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:00,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:00,032 INFO L87 Difference]: Start difference. First operand 6788 states and 9127 transitions. Second operand 4 states. [2019-01-12 17:56:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:00,874 INFO L93 Difference]: Finished difference Result 9283 states and 12564 transitions. [2019-01-12 17:56:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:00,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 17:56:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:00,878 INFO L225 Difference]: With dead ends: 9283 [2019-01-12 17:56:00,879 INFO L226 Difference]: Without dead ends: 5887 [2019-01-12 17:56:00,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2019-01-12 17:56:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 5887. [2019-01-12 17:56:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2019-01-12 17:56:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7905 transitions. [2019-01-12 17:56:01,307 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7905 transitions. Word has length 108 [2019-01-12 17:56:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:01,307 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7905 transitions. [2019-01-12 17:56:01,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7905 transitions. [2019-01-12 17:56:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:56:01,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:01,311 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:01,311 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:01,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2116780850, now seen corresponding path program 1 times [2019-01-12 17:56:01,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:01,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:01,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:56:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:56:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:01,518 INFO L87 Difference]: Start difference. First operand 5887 states and 7905 transitions. Second operand 5 states. [2019-01-12 17:56:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:02,207 INFO L93 Difference]: Finished difference Result 9380 states and 13031 transitions. [2019-01-12 17:56:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:56:02,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-01-12 17:56:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:02,211 INFO L225 Difference]: With dead ends: 9380 [2019-01-12 17:56:02,212 INFO L226 Difference]: Without dead ends: 4682 [2019-01-12 17:56:02,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:56:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-01-12 17:56:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4662. [2019-01-12 17:56:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2019-01-12 17:56:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 6407 transitions. [2019-01-12 17:56:02,767 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 6407 transitions. Word has length 110 [2019-01-12 17:56:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:02,767 INFO L480 AbstractCegarLoop]: Abstraction has 4662 states and 6407 transitions. [2019-01-12 17:56:02,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:56:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 6407 transitions. [2019-01-12 17:56:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:56:02,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:02,770 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:02,770 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash 876136019, now seen corresponding path program 1 times [2019-01-12 17:56:02,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:56:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:56:02,942 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 17:56:03,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:56:03 BoogieIcfgContainer [2019-01-12 17:56:03,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 17:56:03,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 17:56:03,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 17:56:03,195 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 17:56:03,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:37" (3/4) ... [2019-01-12 17:56:03,200 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 17:56:03,482 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 17:56:03,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 17:56:03,483 INFO L168 Benchmark]: Toolchain (without parser) took 28551.07 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 952.6 MB in the beginning and 1.8 GB in the end (delta: -881.6 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,484 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 17:56:03,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,486 INFO L168 Benchmark]: Boogie Preprocessor took 70.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 17:56:03,486 INFO L168 Benchmark]: RCFGBuilder took 2060.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,486 INFO L168 Benchmark]: TraceAbstraction took 25274.24 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 988.3 MB in the beginning and 1.9 GB in the end (delta: -901.2 MB). Peak memory consumption was 215.5 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,488 INFO L168 Benchmark]: Witness Printer took 287.29 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:03,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 760.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2060.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25274.24 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 988.3 MB in the beginning and 1.9 GB in the end (delta: -901.2 MB). Peak memory consumption was 215.5 MB. Max. memory is 11.5 GB. * Witness Printer took 287.29 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 524]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; [L65] int __return_1142; [L66] int __return_1270; [L67] int __return_1696; [L68] int __return_1389; [L69] int __return_1499; VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L72] int main__c1; [L73] int main__i2; [L74] main__c1 = 0 [L75] ep12 = __VERIFIER_nondet_bool() [L76] ep13 = __VERIFIER_nondet_bool() [L77] ep21 = __VERIFIER_nondet_bool() [L78] ep23 = __VERIFIER_nondet_bool() [L79] ep31 = __VERIFIER_nondet_bool() [L80] ep32 = __VERIFIER_nondet_bool() [L81] id1 = __VERIFIER_nondet_char() [L82] r1 = __VERIFIER_nondet_uchar() [L83] st1 = __VERIFIER_nondet_char() [L84] nl1 = __VERIFIER_nondet_char() [L85] m1 = __VERIFIER_nondet_char() [L86] max1 = __VERIFIER_nondet_char() [L87] mode1 = __VERIFIER_nondet_bool() [L88] id2 = __VERIFIER_nondet_char() [L89] r2 = __VERIFIER_nondet_uchar() [L90] st2 = __VERIFIER_nondet_char() [L91] nl2 = __VERIFIER_nondet_char() [L92] m2 = __VERIFIER_nondet_char() [L93] max2 = __VERIFIER_nondet_char() [L94] mode2 = __VERIFIER_nondet_bool() [L95] id3 = __VERIFIER_nondet_char() [L96] r3 = __VERIFIER_nondet_uchar() [L97] st3 = __VERIFIER_nondet_char() [L98] nl3 = __VERIFIER_nondet_char() [L99] m3 = __VERIFIER_nondet_char() [L100] max3 = __VERIFIER_nondet_char() [L101] mode3 = __VERIFIER_nondet_bool() [L103] _Bool init__r121; [L104] _Bool init__r131; [L105] _Bool init__r211; [L106] _Bool init__r231; [L107] _Bool init__r311; [L108] _Bool init__r321; [L109] _Bool init__r122; [L110] int init__tmp; [L111] _Bool init__r132; [L112] int init__tmp___0; [L113] _Bool init__r212; [L114] int init__tmp___1; [L115] _Bool init__r232; [L116] int init__tmp___2; [L117] _Bool init__r312; [L118] int init__tmp___3; [L119] _Bool init__r322; [L120] int init__tmp___4; [L121] int init__tmp___5; [L122] init__r121 = ep12 [L123] init__r131 = ep13 [L124] init__r211 = ep21 [L125] init__r231 = ep23 [L126] init__r311 = ep31 [L127] init__r321 = ep32 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L128] COND FALSE !(!(init__r121 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1830] COND TRUE !(init__r131 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1832] COND TRUE !(ep32 == 0) [L1834] init__tmp = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L132] init__r122 = (_Bool)init__tmp VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L133] COND TRUE !(init__r131 == 0) [L135] init__tmp___0 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] init__r132 = (_Bool)init__tmp___0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] COND TRUE !(init__r211 == 0) [L140] init__tmp___1 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] init__r212 = (_Bool)init__tmp___1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(init__r231 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1761] COND TRUE !(init__r211 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1763] COND TRUE !(ep13 == 0) [L1765] init__tmp___2 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] init__r232 = (_Bool)init__tmp___2 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r311 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1738] COND TRUE !(init__r321 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1740] COND TRUE !(ep21 == 0) [L1742] init__tmp___3 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r312 = (_Bool)init__tmp___3 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r321 == 0) [L155] init__tmp___4 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r322 = (_Bool)init__tmp___4 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L160] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id2) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id3) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)r1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)r3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE !(init__r122 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE !(init__r132 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE !(init__r212 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r232 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r312 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r322 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)st1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)st2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)st3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)nl1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)nl2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)nl3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)mode1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)mode2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)mode3) == 0 [L212] init__tmp___5 = 1 [L213] __return_1142 = init__tmp___5 [L214] main__i2 = __return_1142 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE main__i2 != 0 [L217] p12_old = nomsg [L218] p12_new = nomsg [L219] p13_old = nomsg [L220] p13_new = nomsg [L221] p21_old = nomsg [L222] p21_new = nomsg [L223] p23_old = nomsg [L224] p23_new = nomsg [L225] p31_old = nomsg [L226] p31_new = nomsg [L227] p32_old = nomsg [L228] p32_new = nomsg [L229] main__i2 = 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND FALSE !(!(mode1 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L237] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L239] COND FALSE !(!(ep12 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND TRUE !(ep13 == 0) [L252] int node1____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE max1 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE p13_new == nomsg [L257] node1____CPAchecker_TMP_1 = max1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] mode1 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L263] COND FALSE !(!(mode2 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND TRUE ((int)r2) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE !(ep21 == 0) [L273] int node2____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND TRUE max2 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] COND TRUE p21_new == nomsg [L278] node2____CPAchecker_TMP_0 = max2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND FALSE !(!(ep23 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] mode2 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] COND FALSE !(!(mode3 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L301] COND TRUE ((int)r3) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] COND FALSE !(!(ep31 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L314] COND TRUE !(ep32 == 0) [L316] int node3____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L317] COND TRUE max3 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L319] COND TRUE p32_new == nomsg [L321] node3____CPAchecker_TMP_1 = max3 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L323] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=123, p13_old=-1, p21=0, p21_new=122, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=121, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L325] mode3 = 1 [L326] p12_old = p12_new [L327] p12_new = nomsg [L328] p13_old = p13_new [L329] p13_new = nomsg [L330] p21_old = p21_new [L331] p21_new = nomsg [L332] p23_old = p23_new [L333] p23_new = nomsg [L334] p31_old = p31_new [L335] p31_new = nomsg [L336] p32_old = p32_new [L337] p32_new = nomsg [L339] int check__tmp; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L364] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND TRUE ((int)r1) < 2 [L368] check__tmp = 1 [L369] __return_1270 = check__tmp [L370] main__c1 = __return_1270 [L372] _Bool __tmp_1; [L373] __tmp_1 = main__c1 [L374] _Bool assert__arg; [L375] assert__arg = __tmp_1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND FALSE !(assert__arg == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE !(mode1 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND FALSE !(r1 == 255) [L391] r1 = r1 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=0, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE !(ep21 == 0) [L394] m1 = p21_old [L395] p21_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND FALSE !(!(ep31 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)r1) == 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((int)max1) == ((int)id1) [L412] st1 = 1 [L413] mode1 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L415] COND TRUE !(mode2 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L417] COND FALSE !(r2 == 255) [L423] r2 = r2 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L424] COND FALSE !(!(ep12 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=0, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=121, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L432] COND TRUE !(ep32 == 0) [L434] m2 = p32_old [L435] p32_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L436] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L440] COND FALSE !(((int)r2) == 2) [L446] mode2 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L448] COND TRUE !(mode3 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L450] COND FALSE !(r3 == 255) [L456] r3 = r3 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=0, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=123, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L457] COND TRUE !(ep13 == 0) [L459] m3 = p13_old [L460] p13_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=121, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L461] COND TRUE ((int)m3) > ((int)max3) [L463] max3 = m3 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L465] COND FALSE !(!(ep23 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !(((int)r3) == 2) [L479] mode3 = 0 [L480] p12_old = p12_new [L481] p12_new = nomsg [L482] p13_old = p13_new [L483] p13_new = nomsg [L484] p21_old = p21_new [L485] p21_new = nomsg [L486] p23_old = p23_new [L487] p23_new = nomsg [L488] p31_old = p31_new [L489] p31_new = nomsg [L490] p32_old = p32_new [L491] p32_new = nomsg [L493] int check__tmp; VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L494] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L496] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L498] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L500] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L502] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L514] check__tmp = 0 [L515] __return_1696 = check__tmp [L516] main__c1 = __return_1696 [L518] _Bool __tmp_2; [L519] __tmp_2 = main__c1 [L520] _Bool assert__arg; [L521] assert__arg = __tmp_2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L522] COND TRUE assert__arg == 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L524] __VERIFIER_error() VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_1696=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=123, id2=122, id3=121, m1=122, m2=121, m3=123, max1=123, max2=122, max3=123, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 2 error locations. UNSAFE Result, 25.2s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9653 SDtfs, 9095 SDslu, 7399 SDs, 0 SdLazy, 639 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7075occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 12193 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2001 ConstructedInterpolants, 0 QuantifiedInterpolants, 634839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...