./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-1dbac8b [2018-10-26 20:22:50,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:22:50,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:22:50,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:22:50,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:22:50,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:22:50,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:22:50,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:22:50,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:22:50,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:22:50,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:22:50,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:22:50,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:22:50,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:22:50,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:22:50,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:22:50,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:22:50,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:22:50,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:22:50,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:22:50,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:22:50,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:22:50,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:22:50,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:22:50,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:22:50,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:22:50,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:22:50,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:22:50,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:22:50,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:22:50,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:22:50,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:22:50,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:22:50,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:22:50,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:22:50,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:22:50,592 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:22:50,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:22:50,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:22:50,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:22:50,612 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:22:50,612 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:22:50,612 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:22:50,612 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:22:50,612 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:22:50,613 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:22:50,613 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:22:50,613 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:22:50,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:22:50,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:22:50,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:22:50,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:22:50,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:22:50,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:22:50,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:22:50,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:22:50,617 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:22:50,617 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:22:50,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:22:50,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:22:50,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:22:50,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:22:50,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:22:50,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:22:50,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:22:50,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:22:50,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:22:50,619 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:22:50,619 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:22:50,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:22:50,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:22:50,620 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan 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 -> Taipan 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-10-26 20:22:50,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:22:50,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:22:50,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:22:50,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:22:50,673 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:22:50,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-10-26 20:22:50,729 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/data/cdfbf6e3a/6a2424ebdf9045e6a2b2368bd203cc61/FLAG078ed9814 [2018-10-26 20:22:51,201 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:22:51,202 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-10-26 20:22:51,216 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/data/cdfbf6e3a/6a2424ebdf9045e6a2b2368bd203cc61/FLAG078ed9814 [2018-10-26 20:22:51,232 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/data/cdfbf6e3a/6a2424ebdf9045e6a2b2368bd203cc61 [2018-10-26 20:22:51,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:22:51,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:22:51,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:22:51,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:22:51,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:22:51,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7630e1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51, skipping insertion in model container [2018-10-26 20:22:51,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:22:51,299 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:22:51,597 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:22:51,605 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:22:51,655 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:22:51,696 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:22:51,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51 WrapperNode [2018-10-26 20:22:51,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:22:51,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:22:51,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:22:51,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:22:51,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:22:51,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:22:51,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:22:51,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:22:51,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... [2018-10-26 20:22:51,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:22:51,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:22:51,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:22:51,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:22:51,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/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 [2018-10-26 20:22:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:22:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:22:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:22:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:22:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:22:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:22:53,243 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:22:53,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:53 BoogieIcfgContainer [2018-10-26 20:22:53,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:22:53,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:22:53,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:22:53,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:22:53,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:22:51" (1/3) ... [2018-10-26 20:22:53,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226bc472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:22:53, skipping insertion in model container [2018-10-26 20:22:53,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:51" (2/3) ... [2018-10-26 20:22:53,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226bc472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:22:53, skipping insertion in model container [2018-10-26 20:22:53,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:53" (3/3) ... [2018-10-26 20:22:53,254 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-10-26 20:22:53,265 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:22:53,273 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-26 20:22:53,291 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-26 20:22:53,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:22:53,327 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:22:53,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:22:53,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:22:53,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:22:53,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:22:53,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:22:53,328 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:22:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-10-26 20:22:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 20:22:53,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:53,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:22:53,360 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:53,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash 627106702, now seen corresponding path program 1 times [2018-10-26 20:22:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:53,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:53,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:53,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:53,612 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2018-10-26 20:22:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:53,759 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2018-10-26 20:22:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:53,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-26 20:22:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:53,773 INFO L225 Difference]: With dead ends: 212 [2018-10-26 20:22:53,773 INFO L226 Difference]: Without dead ends: 113 [2018-10-26 20:22:53,777 INFO L605 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 [2018-10-26 20:22:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-26 20:22:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2018-10-26 20:22:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-26 20:22:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-10-26 20:22:53,819 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 9 [2018-10-26 20:22:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:53,820 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-10-26 20:22:53,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-10-26 20:22:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:22:53,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:53,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:22:53,822 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:53,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1534523960, now seen corresponding path program 1 times [2018-10-26 20:22:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:53,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:53,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:53,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:53,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:53,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:53,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:53,923 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2018-10-26 20:22:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:53,999 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-10-26 20:22:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:54,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-26 20:22:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:54,003 INFO L225 Difference]: With dead ends: 96 [2018-10-26 20:22:54,003 INFO L226 Difference]: Without dead ends: 94 [2018-10-26 20:22:54,004 INFO L605 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 [2018-10-26 20:22:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-26 20:22:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-10-26 20:22:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-26 20:22:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-10-26 20:22:54,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2018-10-26 20:22:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:54,016 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-10-26 20:22:54,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-10-26 20:22:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:22:54,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:54,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:22:54,017 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:54,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1534525882, now seen corresponding path program 1 times [2018-10-26 20:22:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:54,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:54,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:54,130 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:54,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:54,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:54,131 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 4 states. [2018-10-26 20:22:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:54,377 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-10-26 20:22:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:54,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-26 20:22:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:54,379 INFO L225 Difference]: With dead ends: 95 [2018-10-26 20:22:54,379 INFO L226 Difference]: Without dead ends: 93 [2018-10-26 20:22:54,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-26 20:22:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-26 20:22:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-26 20:22:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-10-26 20:22:54,388 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 15 [2018-10-26 20:22:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:54,389 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-10-26 20:22:54,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-10-26 20:22:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:22:54,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:54,390 INFO L375 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] [2018-10-26 20:22:54,390 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:54,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 615762310, now seen corresponding path program 1 times [2018-10-26 20:22:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:54,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:54,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:54,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:54,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:54,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:54,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:54,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:54,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:54,488 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 3 states. [2018-10-26 20:22:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:54,788 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-10-26 20:22:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:54,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:22:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:54,790 INFO L225 Difference]: With dead ends: 95 [2018-10-26 20:22:54,790 INFO L226 Difference]: Without dead ends: 91 [2018-10-26 20:22:54,791 INFO L605 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 [2018-10-26 20:22:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-26 20:22:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-10-26 20:22:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-26 20:22:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-10-26 20:22:54,799 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 22 [2018-10-26 20:22:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:54,800 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-10-26 20:22:54,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-10-26 20:22:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:22:54,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:54,801 INFO L375 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] [2018-10-26 20:22:54,801 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:54,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1909102183, now seen corresponding path program 1 times [2018-10-26 20:22:54,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:54,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:54,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:54,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:54,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:54,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:54,901 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 4 states. [2018-10-26 20:22:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:55,063 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2018-10-26 20:22:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:55,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-26 20:22:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:55,064 INFO L225 Difference]: With dead ends: 155 [2018-10-26 20:22:55,065 INFO L226 Difference]: Without dead ends: 133 [2018-10-26 20:22:55,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:22:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-26 20:22:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2018-10-26 20:22:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-26 20:22:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-10-26 20:22:55,073 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 23 [2018-10-26 20:22:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:55,074 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-10-26 20:22:55,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-10-26 20:22:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:22:55,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:55,075 INFO L375 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] [2018-10-26 20:22:55,077 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:55,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1854876944, now seen corresponding path program 1 times [2018-10-26 20:22:55,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:55,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:55,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:55,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:55,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:55,142 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 3 states. [2018-10-26 20:22:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:55,173 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-10-26 20:22:55,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:55,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 20:22:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:55,177 INFO L225 Difference]: With dead ends: 164 [2018-10-26 20:22:55,177 INFO L226 Difference]: Without dead ends: 116 [2018-10-26 20:22:55,177 INFO L605 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 [2018-10-26 20:22:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-26 20:22:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2018-10-26 20:22:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-26 20:22:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-10-26 20:22:55,186 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-10-26 20:22:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:55,187 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-10-26 20:22:55,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-10-26 20:22:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:22:55,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:55,189 INFO L375 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] [2018-10-26 20:22:55,190 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:55,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1666213533, now seen corresponding path program 1 times [2018-10-26 20:22:55,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:55,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:55,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:55,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:55,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:55,349 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 3 states. [2018-10-26 20:22:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:55,392 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-10-26 20:22:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:55,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 20:22:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:55,394 INFO L225 Difference]: With dead ends: 92 [2018-10-26 20:22:55,394 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 20:22:55,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 20:22:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-26 20:22:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-26 20:22:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-10-26 20:22:55,405 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 31 [2018-10-26 20:22:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:55,406 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-10-26 20:22:55,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-10-26 20:22:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:22:55,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:55,408 INFO L375 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] [2018-10-26 20:22:55,408 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2083816414, now seen corresponding path program 1 times [2018-10-26 20:22:55,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:55,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:55,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:55,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:55,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:55,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:55,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:55,532 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 3 states. [2018-10-26 20:22:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:55,581 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-10-26 20:22:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:55,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 20:22:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:55,591 INFO L225 Difference]: With dead ends: 93 [2018-10-26 20:22:55,591 INFO L226 Difference]: Without dead ends: 91 [2018-10-26 20:22:55,592 INFO L605 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 [2018-10-26 20:22:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-26 20:22:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-26 20:22:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-26 20:22:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-10-26 20:22:55,600 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 31 [2018-10-26 20:22:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:55,600 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-10-26 20:22:55,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-10-26 20:22:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:22:55,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:55,602 INFO L375 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] [2018-10-26 20:22:55,602 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:55,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2083818336, now seen corresponding path program 1 times [2018-10-26 20:22:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:55,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:55,715 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 4 states. [2018-10-26 20:22:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:55,847 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-10-26 20:22:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:55,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-26 20:22:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:55,848 INFO L225 Difference]: With dead ends: 92 [2018-10-26 20:22:55,848 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 20:22:55,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 20:22:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-26 20:22:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-26 20:22:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-10-26 20:22:55,855 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 31 [2018-10-26 20:22:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:55,856 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-10-26 20:22:55,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-10-26 20:22:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:22:55,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:55,857 INFO L375 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] [2018-10-26 20:22:55,858 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:55,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1234433972, now seen corresponding path program 1 times [2018-10-26 20:22:55,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:55,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:56,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:56,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:56,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:56,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:56,035 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 4 states. [2018-10-26 20:22:56,208 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:22:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:56,693 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2018-10-26 20:22:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:56,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-26 20:22:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:56,695 INFO L225 Difference]: With dead ends: 228 [2018-10-26 20:22:56,695 INFO L226 Difference]: Without dead ends: 153 [2018-10-26 20:22:56,695 INFO L605 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 [2018-10-26 20:22:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-26 20:22:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 90. [2018-10-26 20:22:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-26 20:22:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-10-26 20:22:56,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 34 [2018-10-26 20:22:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:56,705 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-10-26 20:22:56,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-10-26 20:22:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:22:56,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:56,706 INFO L375 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] [2018-10-26 20:22:56,707 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:56,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1453288690, now seen corresponding path program 1 times [2018-10-26 20:22:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:56,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:56,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:22:56,934 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:56,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:22:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:22:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:22:56,935 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 7 states. [2018-10-26 20:22:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:57,305 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-10-26 20:22:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:22:57,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-26 20:22:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:57,307 INFO L225 Difference]: With dead ends: 246 [2018-10-26 20:22:57,308 INFO L226 Difference]: Without dead ends: 195 [2018-10-26 20:22:57,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:22:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-26 20:22:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2018-10-26 20:22:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-26 20:22:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-10-26 20:22:57,317 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 34 [2018-10-26 20:22:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:57,317 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-10-26 20:22:57,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:22:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-10-26 20:22:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:22:57,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:57,319 INFO L375 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] [2018-10-26 20:22:57,322 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:57,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1100420466, now seen corresponding path program 1 times [2018-10-26 20:22:57,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:57,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 20:22:57,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:57,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:22:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:22:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:22:57,767 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 9 states. [2018-10-26 20:22:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:58,697 INFO L93 Difference]: Finished difference Result 398 states and 441 transitions. [2018-10-26 20:22:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:22:58,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-26 20:22:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:58,701 INFO L225 Difference]: With dead ends: 398 [2018-10-26 20:22:58,701 INFO L226 Difference]: Without dead ends: 396 [2018-10-26 20:22:58,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-10-26 20:22:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-26 20:22:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 136. [2018-10-26 20:22:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-26 20:22:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2018-10-26 20:22:58,716 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 34 [2018-10-26 20:22:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:58,717 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2018-10-26 20:22:58,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:22:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2018-10-26 20:22:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:22:58,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:58,718 INFO L375 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] [2018-10-26 20:22:58,719 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:58,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash -855136654, now seen corresponding path program 1 times [2018-10-26 20:22:58,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:58,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:58,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:59,084 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-26 20:22:59,687 WARN L179 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-10-26 20:22:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:59,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:59,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 20:22:59,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:59,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:22:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:22:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:22:59,852 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand 9 states. [2018-10-26 20:23:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:00,781 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2018-10-26 20:23:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:23:00,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-10-26 20:23:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:00,784 INFO L225 Difference]: With dead ends: 360 [2018-10-26 20:23:00,784 INFO L226 Difference]: Without dead ends: 358 [2018-10-26 20:23:00,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-10-26 20:23:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-26 20:23:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 139. [2018-10-26 20:23:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 20:23:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2018-10-26 20:23:00,799 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 37 [2018-10-26 20:23:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:00,800 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2018-10-26 20:23:00,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:23:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2018-10-26 20:23:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:23:00,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:00,801 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:00,801 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:00,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 152101170, now seen corresponding path program 1 times [2018-10-26 20:23:00,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:00,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:00,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:23:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:23:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:23:00,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:23:00,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:23:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:23:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:23:00,944 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 3 states. [2018-10-26 20:23:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:00,988 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2018-10-26 20:23:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:23:00,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-26 20:23:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:00,990 INFO L225 Difference]: With dead ends: 140 [2018-10-26 20:23:00,990 INFO L226 Difference]: Without dead ends: 138 [2018-10-26 20:23:00,990 INFO L605 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 [2018-10-26 20:23:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-26 20:23:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-26 20:23:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-26 20:23:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2018-10-26 20:23:01,001 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 39 [2018-10-26 20:23:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:01,001 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2018-10-26 20:23:01,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:23:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2018-10-26 20:23:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:23:01,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:01,002 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:01,003 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:01,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash 59672710, now seen corresponding path program 1 times [2018-10-26 20:23:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:01,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:01,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:23:01,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:23:01,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:23:01,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:23:01,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:23:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:23:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:23:01,133 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 5 states. [2018-10-26 20:23:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:01,335 INFO L93 Difference]: Finished difference Result 200 states and 224 transitions. [2018-10-26 20:23:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:23:01,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-10-26 20:23:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:01,336 INFO L225 Difference]: With dead ends: 200 [2018-10-26 20:23:01,336 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 20:23:01,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:23:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 20:23:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-10-26 20:23:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-26 20:23:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2018-10-26 20:23:01,355 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 42 [2018-10-26 20:23:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:01,357 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2018-10-26 20:23:01,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:23:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-10-26 20:23:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:23:01,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:01,359 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:01,360 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:01,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash 413609883, now seen corresponding path program 1 times [2018-10-26 20:23:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:01,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:01,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:01,656 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-26 20:23:01,912 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-26 20:23:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:02,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:02,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:23:02,225 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-26 20:23:02,227 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [16], [20], [26], [29], [35], [40], [48], [52], [58], [62], [64], [67], [144], [148], [155], [159], [167], [173], [177], [181], [183], [186], [192], [199], [203], [211], [214], [215], [259], [266], [270], [276], [360], [361], [362] [2018-10-26 20:23:02,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:23:02,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:23:03,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:23:03,466 INFO L272 AbstractInterpreter]: Visited 39 different actions 57 times. Merged at 16 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 51 variables. [2018-10-26 20:23:03,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:03,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:23:03,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:03,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:23:03,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:03,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:23:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:03,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:23:03,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:23:03,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:23:03,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:23:03,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:23:03,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 20:23:03,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-26 20:23:03,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 20:23:03,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-26 20:23:03,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 20:23:03,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:03,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:23:04,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2018-10-26 20:23:04,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:23:04,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:23:04,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:23:04,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:23:04,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:04,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-26 20:23:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:04,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:23:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:04,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:23:04,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2018-10-26 20:23:04,779 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:23:04,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:23:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:23:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:23:04,779 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand 6 states. [2018-10-26 20:23:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:05,202 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2018-10-26 20:23:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:23:05,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-26 20:23:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:05,204 INFO L225 Difference]: With dead ends: 279 [2018-10-26 20:23:05,205 INFO L226 Difference]: Without dead ends: 202 [2018-10-26 20:23:05,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:23:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-26 20:23:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 176. [2018-10-26 20:23:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-26 20:23:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-10-26 20:23:05,233 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 42 [2018-10-26 20:23:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:05,234 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-10-26 20:23:05,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:23:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-10-26 20:23:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:23:05,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:05,235 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:05,239 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:05,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:05,239 INFO L82 PathProgramCache]: Analyzing trace with hash 311800070, now seen corresponding path program 1 times [2018-10-26 20:23:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:05,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:05,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:05,548 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:23:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:05,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:05,764 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:23:05,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-26 20:23:05,765 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [16], [20], [26], [31], [35], [38], [48], [52], [58], [62], [64], [67], [144], [148], [155], [159], [167], [171], [173], [177], [181], [259], [266], [270], [276], [282], [288], [291], [295], [302], [306], [314], [317], [318], [360], [361], [362] [2018-10-26 20:23:05,770 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:23:05,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:23:06,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:23:06,691 INFO L272 AbstractInterpreter]: Visited 41 different actions 62 times. Merged at 18 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 59 variables. [2018-10-26 20:23:06,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:06,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:23:06,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:06,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:23:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:06,744 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:23:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:06,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:23:07,002 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:23:07,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 20:23:07,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-10-26 20:23:07,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:07,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:07,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-26 20:23:07,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 20:23:07,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:07,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:07,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:23:07,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:41 [2018-10-26 20:23:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:07,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:23:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:07,608 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:23:07,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [7] total 16 [2018-10-26 20:23:07,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:23:07,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:23:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:23:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:23:07,609 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 7 states. [2018-10-26 20:23:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:08,257 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-10-26 20:23:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:23:08,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-26 20:23:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:08,259 INFO L225 Difference]: With dead ends: 250 [2018-10-26 20:23:08,259 INFO L226 Difference]: Without dead ends: 226 [2018-10-26 20:23:08,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-26 20:23:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-26 20:23:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2018-10-26 20:23:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-26 20:23:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-10-26 20:23:08,277 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 42 [2018-10-26 20:23:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:08,277 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-10-26 20:23:08,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:23:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-10-26 20:23:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 20:23:08,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:08,280 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:08,281 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:08,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash -108742968, now seen corresponding path program 1 times [2018-10-26 20:23:08,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:08,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:08,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:23:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:23:08,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:23:08,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:23:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:23:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:23:08,371 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 3 states. [2018-10-26 20:23:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:08,556 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2018-10-26 20:23:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:23:08,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-26 20:23:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:08,559 INFO L225 Difference]: With dead ends: 305 [2018-10-26 20:23:08,559 INFO L226 Difference]: Without dead ends: 236 [2018-10-26 20:23:08,559 INFO L605 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 [2018-10-26 20:23:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-26 20:23:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2018-10-26 20:23:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-26 20:23:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2018-10-26 20:23:08,577 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 44 [2018-10-26 20:23:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:08,579 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2018-10-26 20:23:08,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:23:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2018-10-26 20:23:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 20:23:08,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:08,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:08,582 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 236789566, now seen corresponding path program 1 times [2018-10-26 20:23:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:08,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:08,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:08,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:08,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:23:08,898 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-26 20:23:08,899 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [16], [20], [26], [29], [35], [40], [48], [52], [58], [62], [64], [67], [144], [148], [155], [159], [167], [171], [173], [177], [181], [259], [266], [270], [276], [282], [288], [291], [295], [302], [306], [314], [317], [318], [352], [354], [360], [361], [362] [2018-10-26 20:23:08,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:23:08,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:23:10,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:23:10,059 INFO L272 AbstractInterpreter]: Visited 43 different actions 90 times. Merged at 20 different actions 45 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 58 variables. [2018-10-26 20:23:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:10,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:23:10,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:23:10,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:23:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:10,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:23:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:23:10,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:23:10,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:23:10,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:23:10,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:23:10,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:23:10,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-10-26 20:23:10,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:23:10,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:23:10,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:23:10,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:23:10,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:23:10,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-26 20:23:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:10,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:23:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:23:10,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:23:10,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-10-26 20:23:10,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:23:10,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:23:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:23:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:23:10,388 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand 6 states. [2018-10-26 20:23:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:23:11,139 INFO L93 Difference]: Finished difference Result 338 states and 380 transitions. [2018-10-26 20:23:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:23:11,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-26 20:23:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:23:11,141 INFO L225 Difference]: With dead ends: 338 [2018-10-26 20:23:11,141 INFO L226 Difference]: Without dead ends: 298 [2018-10-26 20:23:11,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:23:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-26 20:23:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2018-10-26 20:23:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-26 20:23:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 276 transitions. [2018-10-26 20:23:11,163 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 276 transitions. Word has length 46 [2018-10-26 20:23:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:23:11,165 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 276 transitions. [2018-10-26 20:23:11,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:23:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 276 transitions. [2018-10-26 20:23:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 20:23:11,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:23:11,166 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:23:11,166 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:23:11,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:23:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1351244782, now seen corresponding path program 1 times [2018-10-26 20:23:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:23:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:23:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:23:11,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:23:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:23:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:23:11,225 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:23:11,243 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,244 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,247 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,247 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,252 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,252 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,255 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,255 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,261 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,261 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,261 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,262 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,262 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,262 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,262 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,263 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,263 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,263 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,271 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,271 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,271 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,272 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,272 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,272 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,272 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,273 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,273 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,273 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,284 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,284 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,284 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,284 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,284 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:23:11 BoogieIcfgContainer [2018-10-26 20:23:11,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:23:11,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:23:11,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:23:11,327 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:23:11,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:53" (3/4) ... [2018-10-26 20:23:11,330 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:23:11,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,351 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,351 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,352 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,353 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,354 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,355 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,356 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,357 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,358 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,371 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:23:11,434 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8aa72dd7-3979-4734-9b9d-9042773bae3f/bin-2019/utaipan/witness.graphml [2018-10-26 20:23:11,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:23:11,435 INFO L168 Benchmark]: Toolchain (without parser) took 20198.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.0 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -72.4 MB). Peak memory consumption was 326.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,436 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:23:11,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 927.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,437 INFO L168 Benchmark]: Boogie Preprocessor took 50.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,437 INFO L168 Benchmark]: RCFGBuilder took 1356.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,437 INFO L168 Benchmark]: TraceAbstraction took 18081.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.5 MB). Peak memory consumption was 315.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,438 INFO L168 Benchmark]: Witness Printer took 107.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:23:11,446 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 927.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1356.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18081.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.5 MB). Peak memory consumption was 315.6 MB. Max. memory is 11.5 GB. * Witness Printer took 107.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) [L991] SLL* list = malloc(sizeof(SLL)); [L992] CALL list->next = ((void*)0) [L992] RET list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(0) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] CALL list->inner = malloc(sizeof(SLL)) [L993] RET list->inner = malloc(sizeof(SLL)) [L993] CALL, EXPR list->inner [L993] RET, EXPR list->inner [L993] CALL list->inner->next = ((void*)0) [L993] RET list->inner->next = ((void*)0) [L993] CALL, EXPR list->inner [L993] RET, EXPR list->inner [L993] CALL list->inner->inner = ((void*)0) [L993] RET list->inner->inner = ((void*)0) [L993] CALL, EXPR list->inner [L993] RET, EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1012] COND FALSE !(0) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] CALL, EXPR end->inner [L1017] RET, EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1024] COND FALSE !(0) [L1025] CALL, EXPR inner->inner [L1025] RET, EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) [L1026] CALL, EXPR inner->next [L1026] RET, EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) [L1027] CALL, EXPR inner->inner [L1027] RET, EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] CALL, EXPR inner->inner [L1029] RET, EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1024] COND FALSE !(0) [L1025] CALL, EXPR inner->inner [L1025] RET, EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 100 locations, 13 error locations. UNSAFE Result, 18.0s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1770 SDtfs, 2356 SDslu, 3207 SDs, 0 SdLazy, 1373 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 274 SyntacticMatches, 22 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 897 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 237108 SizeOfPredicates, 67 NumberOfNonLiveVariables, 693 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 19/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...