./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a99c5e1922c5e2d2ce50e982def02dab2dbd81e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:25:17,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:25:17,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:25:17,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:25:17,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:25:17,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:25:17,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:25:17,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:25:17,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:25:17,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:25:17,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:25:17,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:25:17,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:25:17,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:25:17,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:25:17,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:25:17,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:25:18,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:25:18,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:25:18,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:25:18,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:25:18,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:25:18,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:25:18,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:25:18,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:25:18,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:25:18,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:25:18,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:25:18,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:25:18,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:25:18,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:25:18,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:25:18,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:25:18,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:25:18,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:25:18,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:25:18,037 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:25:18,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:25:18,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:25:18,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:25:18,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:25:18,055 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:25:18,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:25:18,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:25:18,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:25:18,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:25:18,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:25:18,057 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:25:18,057 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:25:18,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:25:18,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:25:18,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:25:18,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:25:18,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:25:18,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:25:18,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:25:18,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:25:18,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:25:18,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:25:18,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:25:18,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a99c5e1922c5e2d2ce50e982def02dab2dbd81e [2018-12-31 05:25:18,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:25:18,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:25:18,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:25:18,118 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:25:18,118 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:25:18,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:18,188 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9f9e3e1/a8f9d58fea4147bc911fd0f2328ce973/FLAG4dd2532a7 [2018-12-31 05:25:18,747 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:25:18,747 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:18,761 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9f9e3e1/a8f9d58fea4147bc911fd0f2328ce973/FLAG4dd2532a7 [2018-12-31 05:25:19,014 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9f9e3e1/a8f9d58fea4147bc911fd0f2328ce973 [2018-12-31 05:25:19,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:25:19,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:25:19,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:19,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:25:19,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:25:19,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a56145b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19, skipping insertion in model container [2018-12-31 05:25:19,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:25:19,099 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:25:19,535 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:19,545 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:25:19,617 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:19,778 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:25:19,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19 WrapperNode [2018-12-31 05:25:19,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:19,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:19,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:25:19,780 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:25:19,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:19,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:25:19,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:25:19,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:25:19,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... [2018-12-31 05:25:19,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:25:19,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:25:19,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:25:19,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:25:19,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:25:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:25:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:25:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:25:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:25:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:25:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:25:20,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:25:20,463 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 05:25:20,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:20 BoogieIcfgContainer [2018-12-31 05:25:20,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:25:20,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:25:20,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:25:20,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:25:20,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:25:19" (1/3) ... [2018-12-31 05:25:20,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13160512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:20, skipping insertion in model container [2018-12-31 05:25:20,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:19" (2/3) ... [2018-12-31 05:25:20,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13160512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:20, skipping insertion in model container [2018-12-31 05:25:20,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:20" (3/3) ... [2018-12-31 05:25:20,472 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:20,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:25:20,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:25:20,507 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:25:20,538 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:25:20,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:25:20,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:25:20,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:25:20,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:25:20,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:25:20,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:25:20,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:25:20,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:25:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-31 05:25:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 05:25:20,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:20,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:20,565 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1609818497, now seen corresponding path program 1 times [2018-12-31 05:25:20,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:20,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:20,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:25:20,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:25:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:25:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:25:20,717 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-12-31 05:25:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:20,734 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-12-31 05:25:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:25:20,736 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 05:25:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:20,747 INFO L225 Difference]: With dead ends: 41 [2018-12-31 05:25:20,747 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 05:25:20,750 INFO L631 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-12-31 05:25:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 05:25:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 05:25:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 05:25:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-31 05:25:20,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-12-31 05:25:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:20,788 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-31 05:25:20,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:25:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-12-31 05:25:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 05:25:20,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:20,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:20,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1841193493, now seen corresponding path program 1 times [2018-12-31 05:25:20,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:20,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:20,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:20,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:25:20,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:25:20,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:25:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:25:20,969 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2018-12-31 05:25:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:21,203 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-31 05:25:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:25:21,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 05:25:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:21,205 INFO L225 Difference]: With dead ends: 28 [2018-12-31 05:25:21,205 INFO L226 Difference]: Without dead ends: 20 [2018-12-31 05:25:21,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:25:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-31 05:25:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-12-31 05:25:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 05:25:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-31 05:25:21,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2018-12-31 05:25:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:21,212 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-31 05:25:21,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:25:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-31 05:25:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 05:25:21,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:21,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:21,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 62364126, now seen corresponding path program 1 times [2018-12-31 05:25:21,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:21,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 05:25:21,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:25:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:25:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:25:21,417 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2018-12-31 05:25:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:21,766 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-12-31 05:25:21,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:25:21,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-31 05:25:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:21,768 INFO L225 Difference]: With dead ends: 26 [2018-12-31 05:25:21,768 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 05:25:21,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:25:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 05:25:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-31 05:25:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 05:25:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-31 05:25:21,776 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2018-12-31 05:25:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:21,777 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-31 05:25:21,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:25:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-31 05:25:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:25:21,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:21,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:21,779 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1984942171, now seen corresponding path program 1 times [2018-12-31 05:25:21,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:21,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:25:21,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:21,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-12-31 05:25:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:21,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:25:21,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:21,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-31 05:25:21,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:25:21,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:25:21,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:25:21,995 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2018-12-31 05:25:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:22,190 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-31 05:25:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:25:22,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-31 05:25:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:22,193 INFO L225 Difference]: With dead ends: 33 [2018-12-31 05:25:22,193 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 05:25:22,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:25:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 05:25:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-31 05:25:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 05:25:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-31 05:25:22,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2018-12-31 05:25:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:22,201 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-31 05:25:22,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:25:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-12-31 05:25:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 05:25:22,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:22,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:22,204 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2045115300, now seen corresponding path program 2 times [2018-12-31 05:25:22,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:22,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:22,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:25:22,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:25:22,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:22,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:25:22,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-12-31 05:25:22,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 05:25:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 05:25:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:25:22,940 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 13 states. [2018-12-31 05:25:23,398 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-31 05:25:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:23,811 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-31 05:25:23,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 05:25:23,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-12-31 05:25:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:23,819 INFO L225 Difference]: With dead ends: 35 [2018-12-31 05:25:23,820 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 05:25:23,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-12-31 05:25:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 05:25:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 05:25:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 05:25:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-12-31 05:25:23,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2018-12-31 05:25:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:23,830 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-31 05:25:23,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 05:25:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-12-31 05:25:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:25:23,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:23,833 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:23,833 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1887110686, now seen corresponding path program 3 times [2018-12-31 05:25:23,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:23,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:23,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:23,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:24,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:24,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-12-31 05:25:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:25:24,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-31 05:25:24,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:24,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 05:25:24,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:24,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-12-31 05:25:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 05:25:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 05:25:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:25:24,607 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 19 states. [2018-12-31 05:25:25,451 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-31 05:25:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:26,507 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-12-31 05:25:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 05:25:26,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-12-31 05:25:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:26,509 INFO L225 Difference]: With dead ends: 61 [2018-12-31 05:25:26,509 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 05:25:26,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 05:25:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 05:25:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 27. [2018-12-31 05:25:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 05:25:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-31 05:25:26,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2018-12-31 05:25:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:26,518 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-31 05:25:26,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 05:25:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-31 05:25:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 05:25:26,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:26,520 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:26,520 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1577456613, now seen corresponding path program 4 times [2018-12-31 05:25:26,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:26,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:26,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:26,591 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:25:26,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:25:26 BoogieIcfgContainer [2018-12-31 05:25:26,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:25:26,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:25:26,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:25:26,644 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:25:26,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:20" (3/4) ... [2018-12-31 05:25:26,649 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:25:26,719 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:25:26,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:25:26,720 INFO L168 Benchmark]: Toolchain (without parser) took 7702.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,722 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:26,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,723 INFO L168 Benchmark]: Boogie Preprocessor took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:26,724 INFO L168 Benchmark]: RCFGBuilder took 564.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,724 INFO L168 Benchmark]: TraceAbstraction took 6178.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.5 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,725 INFO L168 Benchmark]: Witness Printer took 75.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:26,729 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 759.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 564.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6178.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.5 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Witness Printer took 75.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L564] SLL head = ((void *)0); [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND FALSE !(len > 0) [L574] return head; [L596] SLL s = sll_create(len + 1); [L577] int len = 0; [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) [L582] return len; [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. UNSAFE Result, 6.1s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 294 SDslu, 274 SDs, 0 SdLazy, 407 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 197 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 10346 SizeOfPredicates, 8 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 21/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...