./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0210da8 [2018-10-21 12:24:29,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:24:29,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:24:29,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:24:29,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:24:29,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:24:29,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:24:29,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:24:29,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:24:29,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:24:29,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:24:29,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:24:29,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:24:29,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:24:29,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:24:29,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:24:29,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:24:29,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:24:29,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:24:29,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:24:29,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:24:29,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:24:29,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:24:29,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:24:29,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:24:29,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:24:29,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:24:29,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:24:29,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:24:29,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:24:29,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:24:29,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:24:29,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:24:29,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:24:29,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:24:29,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:24:29,869 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:24:29,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:24:29,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:24:29,888 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:24:29,888 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:24:29,888 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:24:29,888 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:24:29,889 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:24:29,889 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:24:29,889 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:24:29,889 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:24:29,889 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:24:29,891 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:24:29,891 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:24:29,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:24:29,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:24:29,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:24:29,892 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:24:29,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:24:29,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:24:29,893 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:24:29,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:24:29,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:24:29,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:24:29,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:24:29,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:24:29,894 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:24:29,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:24:29,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:24:29,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:24:29,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:24:29,895 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:24:29,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:24:29,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:24:29,896 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:24:29,898 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 -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-10-21 12:24:29,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:24:29,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:24:29,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:24:29,990 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:24:29,991 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:24:29,992 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-10-21 12:24:30,063 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71bd5952e/6ad5b4a020d74c3486e31541e76c2775/FLAG6ae38b209 [2018-10-21 12:24:30,524 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:24:30,525 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-10-21 12:24:30,532 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71bd5952e/6ad5b4a020d74c3486e31541e76c2775/FLAG6ae38b209 [2018-10-21 12:24:30,550 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71bd5952e/6ad5b4a020d74c3486e31541e76c2775 [2018-10-21 12:24:30,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:24:30,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:24:30,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:24:30,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:24:30,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:24:30,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b583796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30, skipping insertion in model container [2018-10-21 12:24:30,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:24:30,604 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:24:30,834 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:24:30,839 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:24:30,880 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:24:30,908 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:24:30,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30 WrapperNode [2018-10-21 12:24:30,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:24:30,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:24:30,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:24:30,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:24:30,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:24:30,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:24:30,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:24:30,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:24:30,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:30,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... [2018-10-21 12:24:31,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:24:31,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:24:31,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:24:31,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:24:31,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:24:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:24:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:24:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:24:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:24:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:24:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:24:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:24:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:24:31,650 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:24:31,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:31 BoogieIcfgContainer [2018-10-21 12:24:31,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:24:31,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:24:31,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:24:31,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:24:31,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:24:30" (1/3) ... [2018-10-21 12:24:31,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250d882b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:24:31, skipping insertion in model container [2018-10-21 12:24:31,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:30" (2/3) ... [2018-10-21 12:24:31,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250d882b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:24:31, skipping insertion in model container [2018-10-21 12:24:31,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:31" (3/3) ... [2018-10-21 12:24:31,662 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-10-21 12:24:31,673 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:24:31,682 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:24:31,701 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:24:31,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:24:31,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:24:31,734 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:24:31,734 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:24:31,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:24:31,735 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:24:31,735 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:24:31,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:24:31,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:24:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-21 12:24:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-21 12:24:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:31,761 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:31,764 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:31,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-21 12:24:31,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:31,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:31,822 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:31,939 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-21 12:24:31,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:24:31,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:24:31,942 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:24:31,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:24:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:24:31,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:24:31,967 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-21 12:24:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:31,988 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-21 12:24:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:24:31,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-21 12:24:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:32,000 INFO L225 Difference]: With dead ends: 51 [2018-10-21 12:24:32,000 INFO L226 Difference]: Without dead ends: 25 [2018-10-21 12:24:32,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:24:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-21 12:24:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-21 12:24:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-21 12:24:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-21 12:24:32,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-21 12:24:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:32,051 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-21 12:24:32,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:24:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-21 12:24:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-21 12:24:32,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:32,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:32,053 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:32,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-21 12:24:32,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:32,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:32,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:32,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:32,057 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:32,400 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-21 12:24:32,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:24:32,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:24:32,401 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:24:32,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:24:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:24:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:24:32,407 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-21 12:24:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:32,611 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-10-21 12:24:32,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:24:32,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-21 12:24:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:32,614 INFO L225 Difference]: With dead ends: 42 [2018-10-21 12:24:32,614 INFO L226 Difference]: Without dead ends: 28 [2018-10-21 12:24:32,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:24:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-21 12:24:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-21 12:24:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-21 12:24:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-21 12:24:32,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-21 12:24:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:32,623 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-21 12:24:32,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:24:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-21 12:24:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-21 12:24:32,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:32,624 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] [2018-10-21 12:24:32,626 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:32,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-21 12:24:32,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:32,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:32,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:32,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:32,629 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:32,808 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-21 12:24:32,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:24:32,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:24:32,809 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:24:32,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:24:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:24:32,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:24:32,812 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-10-21 12:24:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:33,051 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-10-21 12:24:33,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-21 12:24:33,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-21 12:24:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:33,057 INFO L225 Difference]: With dead ends: 53 [2018-10-21 12:24:33,064 INFO L226 Difference]: Without dead ends: 35 [2018-10-21 12:24:33,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-21 12:24:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-21 12:24:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-21 12:24:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-21 12:24:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-21 12:24:33,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-21 12:24:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:33,076 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-21 12:24:33,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:24:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-21 12:24:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-21 12:24:33,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:33,078 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:33,078 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:33,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-21 12:24:33,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:33,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:33,080 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:33,507 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-21 12:24:34,070 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-10-21 12:24:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:34,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:34,296 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:34,297 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-21 12:24:34,300 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-21 12:24:34,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:24:34,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:24:34,519 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:24:39,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:24:39,799 INFO L272 AbstractInterpreter]: Visited 22 different actions 478 times. Merged at 12 different actions 314 times. Widened at 4 different actions 72 times. Found 30 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-21 12:24:39,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:39,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:24:39,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:39,817 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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-21 12:24:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:39,828 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:39,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:39,956 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 5 treesize of output 1 [2018-10-21 12:24:39,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:39,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:39,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-21 12:24:40,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-10-21 12:24:40,231 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 12 treesize of output 11 [2018-10-21 12:24:40,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-21 12:24:40,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-21 12:24:40,477 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:40,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-21 12:24:40,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,502 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-21 12:24:40,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,517 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-21 12:24:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:40,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:40,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-10-21 12:24:40,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-21 12:24:40,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-21 12:24:40,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:40,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-21 12:24:40,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-21 12:24:40,815 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-10-21 12:24:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:41,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:41,011 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:24:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:41,029 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:41,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:41,288 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-21 12:24:41,306 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 5 treesize of output 1 [2018-10-21 12:24:41,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-21 12:24:41,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-21 12:24:41,395 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 11 treesize of output 10 [2018-10-21 12:24:41,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-21 12:24:41,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-10-21 12:24:41,576 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 12 treesize of output 11 [2018-10-21 12:24:41,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-10-21 12:24:41,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-21 12:24:41,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:41,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-21 12:24:41,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,835 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:41,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-21 12:24:41,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:41,871 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2018-10-21 12:24:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:41,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:42,057 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 54 [2018-10-21 12:24:42,176 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-10-21 12:24:42,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:42,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 39 [2018-10-21 12:24:42,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:42,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-10-21 12:24:42,263 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-10-21 12:24:42,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:42,326 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 16 treesize of output 7 [2018-10-21 12:24:42,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:42,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:42,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2018-10-21 12:24:42,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-21 12:24:42,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-21 12:24:42,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-21 12:24:42,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-21 12:24:42,436 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:78, output treesize:11 [2018-10-21 12:24:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:24:42,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 33 [2018-10-21 12:24:42,471 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:24:42,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-21 12:24:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-21 12:24:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-21 12:24:42,479 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 21 states. [2018-10-21 12:24:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:43,280 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-10-21 12:24:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-21 12:24:43,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-10-21 12:24:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:43,282 INFO L225 Difference]: With dead ends: 59 [2018-10-21 12:24:43,283 INFO L226 Difference]: Without dead ends: 57 [2018-10-21 12:24:43,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2018-10-21 12:24:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-21 12:24:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-10-21 12:24:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-21 12:24:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-21 12:24:43,292 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-10-21 12:24:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:43,293 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-21 12:24:43,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-21 12:24:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-21 12:24:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-21 12:24:43,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:43,294 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:43,294 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:43,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1367946380, now seen corresponding path program 2 times [2018-10-21 12:24:43,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:43,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:43,296 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:43,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:43,443 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:43,443 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:24:43,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:24:43,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:43,444 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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-21 12:24:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:24:43,462 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:24:43,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:24:43,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:24:43,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:43,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:43,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:43,598 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:24:43,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:24:43,614 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:24:43,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:24:43,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:24:43,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:43,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:43,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:24:43,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 6 [2018-10-21 12:24:43,846 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:24:43,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-21 12:24:43,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-21 12:24:43,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:24:43,847 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-10-21 12:24:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:43,972 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-10-21 12:24:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-21 12:24:43,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-21 12:24:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:43,975 INFO L225 Difference]: With dead ends: 70 [2018-10-21 12:24:43,975 INFO L226 Difference]: Without dead ends: 58 [2018-10-21 12:24:43,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-21 12:24:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-21 12:24:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-10-21 12:24:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-21 12:24:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-10-21 12:24:43,984 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-10-21 12:24:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:43,984 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-10-21 12:24:43,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-21 12:24:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-10-21 12:24:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-21 12:24:43,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:43,985 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:43,986 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:43,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 3 times [2018-10-21 12:24:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:43,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:24:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:43,987 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:24:44,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:44,547 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:44,548 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:24:44,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:24:44,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:44,548 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:24:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:24:44,560 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:24:44,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-21 12:24:44,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:24:44,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:44,654 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 5 treesize of output 1 [2018-10-21 12:24:44,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-21 12:24:44,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-21 12:24:44,724 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 11 treesize of output 10 [2018-10-21 12:24:44,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:19 [2018-10-21 12:24:44,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-21 12:24:44,759 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-21 12:24:44,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-10-21 12:24:44,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-10-21 12:24:44,819 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 12 treesize of output 11 [2018-10-21 12:24:44,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:44,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-21 12:24:44,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-10-21 12:24:45,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-10-21 12:24:45,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:45,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-21 12:24:45,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,288 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-21 12:24:45,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,308 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2018-10-21 12:24:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-21 12:24:45,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:45,671 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-21 12:24:45,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:135, output treesize:1 [2018-10-21 12:24:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:24:45,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:45,764 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:24:45,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:24:45,781 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:24:45,949 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-21 12:24:45,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:24:45,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:45,984 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 5 treesize of output 1 [2018-10-21 12:24:45,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:45,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-21 12:24:46,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-21 12:24:46,082 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-21 12:24:46,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:8 [2018-10-21 12:24:46,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-21 12:24:46,177 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-21 12:24:46,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:8 [2018-10-21 12:24:46,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-21 12:24:46,230 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-21 12:24:46,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 [2018-10-21 12:24:46,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-10-21 12:24:46,293 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 12 treesize of output 11 [2018-10-21 12:24:46,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-21 12:24:46,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-10-21 12:24:46,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-21 12:24:46,420 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 24 treesize of output 25 [2018-10-21 12:24:46,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-21 12:24:46,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-10-21 12:24:46,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-21 12:24:46,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:46,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-21 12:24:46,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,689 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-21 12:24:46,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:46,700 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-21 12:24:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:24:46,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:24:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:24:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12, 13, 12] total 38 [2018-10-21 12:24:48,948 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:24:48,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-21 12:24:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-21 12:24:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1214, Unknown=1, NotChecked=0, Total=1406 [2018-10-21 12:24:48,950 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 20 states. [2018-10-21 12:24:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:49,712 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-10-21 12:24:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-21 12:24:49,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-10-21 12:24:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:49,717 INFO L225 Difference]: With dead ends: 91 [2018-10-21 12:24:49,717 INFO L226 Difference]: Without dead ends: 89 [2018-10-21 12:24:49,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=315, Invalid=1576, Unknown=1, NotChecked=0, Total=1892 [2018-10-21 12:24:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-21 12:24:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2018-10-21 12:24:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-21 12:24:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-21 12:24:49,729 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 30 [2018-10-21 12:24:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:49,729 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-21 12:24:49,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-21 12:24:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-10-21 12:24:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-21 12:24:49,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:49,731 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] [2018-10-21 12:24:49,731 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:49,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1011030201, now seen corresponding path program 1 times [2018-10-21 12:24:49,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:49,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:24:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:49,733 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:24:49,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:49,847 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:49,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-21 12:24:49,847 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-21 12:24:49,849 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:24:49,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:24:49,862 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:24:56,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:24:56,311 INFO L272 AbstractInterpreter]: Visited 27 different actions 920 times. Merged at 15 different actions 505 times. Widened at 5 different actions 99 times. Found 59 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-21 12:24:56,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:56,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:24:56,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:56,326 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:24:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,334 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:56,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:24:56,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:24:56,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:56,524 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:24:56,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,540 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:56,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:24:56,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:24:56,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:24:56,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 11 [2018-10-21 12:24:56,657 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:24:56,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-21 12:24:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-21 12:24:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-21 12:24:56,658 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 10 states. [2018-10-21 12:24:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:56,798 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-10-21 12:24:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:24:56,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-10-21 12:24:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:56,802 INFO L225 Difference]: With dead ends: 82 [2018-10-21 12:24:56,802 INFO L226 Difference]: Without dead ends: 57 [2018-10-21 12:24:56,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:24:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-21 12:24:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-10-21 12:24:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-21 12:24:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-10-21 12:24:56,811 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 33 [2018-10-21 12:24:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:56,811 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-21 12:24:56,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-21 12:24:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-10-21 12:24:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-21 12:24:56,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:56,813 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:56,813 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:56,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 4 times [2018-10-21 12:24:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,815 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:57,375 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:57,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:24:57,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:24:57,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:57,376 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:24:57,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:24:57,385 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-21 12:24:57,409 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:24:57,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:24:57,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:57,424 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-21 12:24:57,444 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-21 12:24:57,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-21 12:24:57,536 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-21 12:24:57,549 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-21 12:24:57,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-21 12:24:57,583 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-21 12:24:57,586 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-21 12:24:57,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-21 12:24:57,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2018-10-21 12:24:57,644 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 19 treesize of output 18 [2018-10-21 12:24:57,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-21 12:24:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-10-21 12:24:57,906 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:57,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-10-21 12:24:57,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,928 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 15 treesize of output 8 [2018-10-21 12:24:57,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,946 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:57,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-10-21 12:24:57,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:57,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-10-21 12:24:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:24:58,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:25:00,281 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2018-10-21 12:25:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:25:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:25:00,442 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:25:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:25:00,461 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-21 12:25:00,873 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:25:00,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:25:00,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:25:00,889 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 14 treesize of output 11 [2018-10-21 12:25:00,891 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 11 treesize of output 10 [2018-10-21 12:25:00,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-10-21 12:25:00,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-10-21 12:25:00,939 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 17 treesize of output 16 [2018-10-21 12:25:00,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-21 12:25:01,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2018-10-21 12:25:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 35 [2018-10-21 12:25:01,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-10-21 12:25:01,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 46 [2018-10-21 12:25:01,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-21 12:25:01,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2018-10-21 12:25:01,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,301 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-10-21 12:25:01,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2018-10-21 12:25:01,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-21 12:25:01,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:25:01,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-10-21 12:25:01,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:60, output treesize:3 [2018-10-21 12:25:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:25:01,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:25:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-21 12:25:06,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:25:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14, 14, 14] total 44 [2018-10-21 12:25:06,049 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:25:06,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-21 12:25:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-21 12:25:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1631, Unknown=2, NotChecked=0, Total=1892 [2018-10-21 12:25:06,051 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 20 states. [2018-10-21 12:25:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:25:07,030 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-10-21 12:25:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-21 12:25:07,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-10-21 12:25:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:25:07,034 INFO L225 Difference]: With dead ends: 124 [2018-10-21 12:25:07,034 INFO L226 Difference]: Without dead ends: 109 [2018-10-21 12:25:07,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=537, Invalid=3001, Unknown=2, NotChecked=0, Total=3540 [2018-10-21 12:25:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-21 12:25:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 61. [2018-10-21 12:25:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-21 12:25:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-10-21 12:25:07,048 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 33 [2018-10-21 12:25:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:25:07,048 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-10-21 12:25:07,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-21 12:25:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-10-21 12:25:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-21 12:25:07,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:25:07,052 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:25:07,052 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:25:07,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:25:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash -669879850, now seen corresponding path program 2 times [2018-10-21 12:25:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:25:07,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:25:07,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:25:07,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:25:07,054 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:25:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-21 12:25:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-21 12:25:07,176 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-21 12:25:07,197 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,204 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,204 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,204 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,205 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,205 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,205 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,206 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,208 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,208 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,210 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,210 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,210 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,211 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,213 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,213 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,213 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,218 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,226 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,226 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,226 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,231 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,231 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,231 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,232 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,233 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,233 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,234 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,234 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,234 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:25:07 BoogieIcfgContainer [2018-10-21 12:25:07,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:25:07,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:25:07,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:25:07,280 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:25:07,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:31" (3/4) ... [2018-10-21 12:25:07,285 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-21 12:25:07,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,302 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-21 12:25:07,397 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:25:07,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:25:07,401 INFO L168 Benchmark]: Toolchain (without parser) took 36846.43 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-10-21 12:25:07,402 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:25:07,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:07,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:25:07,404 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:07,404 INFO L168 Benchmark]: RCFGBuilder took 643.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:07,405 INFO L168 Benchmark]: TraceAbstraction took 35627.14 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 84.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-21 12:25:07,405 INFO L168 Benchmark]: Witness Printer took 117.67 ms. Allocated memory is still 2.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:25:07,409 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 643.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35627.14 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 84.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 117.67 ms. Allocated memory is still 2.6 GB. Free memory is still 1.1 GB. There was no memory consumed. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] CALL char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 [L18] COND TRUE i= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND TRUE i >= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND FALSE !(i >= 0) [L30] j = MAX-1 [L31] i=0 [L31] COND TRUE i