./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d15e59fd1b84d7219285b33cc166f567d0bcf3e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:49:38,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:49:38,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:49:38,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:49:38,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:49:38,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:49:38,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:49:38,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:49:38,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:49:38,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:49:38,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:49:38,949 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:49:38,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:49:38,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:49:38,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:49:38,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:49:38,955 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:49:38,957 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:49:38,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:49:38,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:49:38,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:49:38,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:49:38,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:49:38,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:49:38,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:49:38,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:49:38,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:49:38,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:49:38,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:49:38,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:49:38,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:49:38,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:49:38,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:49:38,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:49:38,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:49:38,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:49:38,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:49:38,991 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:49:38,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:49:38,992 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:49:38,993 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:49:38,993 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:49:38,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:49:38,993 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:49:38,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:49:38,994 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:49:38,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:49:38,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:49:38,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:49:38,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:49:38,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:49:38,996 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:49:38,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:49:38,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:49:38,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:49:38,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:49:38,996 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:49:38,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:49:38,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:49:38,999 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 -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2019-01-14 15:49:39,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:49:39,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:49:39,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:49:39,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:49:39,091 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:49:39,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c [2019-01-14 15:49:39,151 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c16a6c7/7695fc829a4a4475a0af0255c1d6afe2/FLAGbe189d7aa [2019-01-14 15:49:39,554 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:49:39,555 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c [2019-01-14 15:49:39,562 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c16a6c7/7695fc829a4a4475a0af0255c1d6afe2/FLAGbe189d7aa [2019-01-14 15:49:39,912 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c16a6c7/7695fc829a4a4475a0af0255c1d6afe2 [2019-01-14 15:49:39,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:49:39,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:49:39,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:49:39,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:49:39,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:49:39,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:39" (1/1) ... [2019-01-14 15:49:39,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee1395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:39, skipping insertion in model container [2019-01-14 15:49:39,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:39" (1/1) ... [2019-01-14 15:49:39,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:49:39,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:49:40,222 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:49:40,237 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:49:40,278 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:49:40,298 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:49:40,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40 WrapperNode [2019-01-14 15:49:40,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:49:40,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:49:40,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:49:40,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:49:40,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:49:40,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:49:40,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:49:40,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:49:40,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... [2019-01-14 15:49:40,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:49:40,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:49:40,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:49:40,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:49:40,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:49:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:49:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:49:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:49:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:49:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:49:40,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:49:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:49:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:49:40,967 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:49:40,968 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 15:49:40,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:40 BoogieIcfgContainer [2019-01-14 15:49:40,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:49:40,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:49:40,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:49:40,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:49:40,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:49:39" (1/3) ... [2019-01-14 15:49:40,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:49:40, skipping insertion in model container [2019-01-14 15:49:40,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:40" (2/3) ... [2019-01-14 15:49:40,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:49:40, skipping insertion in model container [2019-01-14 15:49:40,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:40" (3/3) ... [2019-01-14 15:49:40,977 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2019-01-14 15:49:40,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:49:40,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:49:41,018 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:49:41,045 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:49:41,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:49:41,046 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:49:41,046 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:49:41,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:49:41,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:49:41,047 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:49:41,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:49:41,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:49:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-14 15:49:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 15:49:41,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:41,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:41,069 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-01-14 15:49:41,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:49:41,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:49:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:49:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:49:41,252 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-14 15:49:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:41,269 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-01-14 15:49:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:49:41,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 15:49:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:41,281 INFO L225 Difference]: With dead ends: 30 [2019-01-14 15:49:41,281 INFO L226 Difference]: Without dead ends: 13 [2019-01-14 15:49:41,284 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 [2019-01-14 15:49:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-14 15:49:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 15:49:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 15:49:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-14 15:49:41,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-14 15:49:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:41,315 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-14 15:49:41,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:49:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-14 15:49:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:49:41,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:41,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:41,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-01-14 15:49:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:49:41,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:49:41,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:49:41,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:49:41,405 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-01-14 15:49:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:41,478 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-14 15:49:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:49:41,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 15:49:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:41,480 INFO L225 Difference]: With dead ends: 24 [2019-01-14 15:49:41,480 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 15:49:41,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:49:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 15:49:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 15:49:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 15:49:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-14 15:49:41,485 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-01-14 15:49:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:41,485 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-14 15:49:41,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:49:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-14 15:49:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:49:41,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:41,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:41,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-01-14 15:49:41,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:41,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:41,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:41,613 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 [2019-01-14 15:49:41,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:41,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:41,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:41,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 15:49:41,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:49:41,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:49:41,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:49:41,748 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-01-14 15:49:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:41,840 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-14 15:49:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:49:41,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 15:49:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:41,843 INFO L225 Difference]: With dead ends: 26 [2019-01-14 15:49:41,843 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 15:49:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:49:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 15:49:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 15:49:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 15:49:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-14 15:49:41,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-01-14 15:49:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:41,849 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-14 15:49:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:49:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-14 15:49:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:49:41,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:41,850 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:41,851 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-01-14 15:49:41,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:42,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:42,039 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 [2019-01-14 15:49:42,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:49:42,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:49:42,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:42,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:42,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:42,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 15:49:42,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:49:42,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:49:42,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:49:42,183 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-01-14 15:49:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:42,334 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-14 15:49:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:49:42,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 15:49:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:42,336 INFO L225 Difference]: With dead ends: 28 [2019-01-14 15:49:42,336 INFO L226 Difference]: Without dead ends: 19 [2019-01-14 15:49:42,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:49:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-14 15:49:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 15:49:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 15:49:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-14 15:49:42,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-01-14 15:49:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:42,341 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-14 15:49:42,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:49:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-14 15:49:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:49:42,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:42,342 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:42,343 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 123871506, now seen corresponding path program 3 times [2019-01-14 15:49:42,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:42,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:42,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:42,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:42,492 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 [2019-01-14 15:49:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:49:42,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 15:49:42,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:42,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 15:49:42,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:49:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:49:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:49:42,775 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-01-14 15:49:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:42,915 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-14 15:49:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:49:42,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-14 15:49:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:42,917 INFO L225 Difference]: With dead ends: 30 [2019-01-14 15:49:42,917 INFO L226 Difference]: Without dead ends: 21 [2019-01-14 15:49:42,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:49:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-14 15:49:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-14 15:49:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 15:49:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 15:49:42,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-01-14 15:49:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:42,922 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 15:49:42,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:49:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 15:49:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:49:42,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:42,923 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:42,924 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:42,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1444204464, now seen corresponding path program 4 times [2019-01-14 15:49:42,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:42,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:42,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:43,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:43,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:49:43,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 15:49:43,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 15:49:43,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:43,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:43,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:43,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 15:49:43,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 15:49:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 15:49:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:49:43,513 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-14 15:49:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:43,610 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-01-14 15:49:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:49:43,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 15:49:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:43,612 INFO L225 Difference]: With dead ends: 32 [2019-01-14 15:49:43,612 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 15:49:43,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:49:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 15:49:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 15:49:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 15:49:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-14 15:49:43,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-01-14 15:49:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:43,619 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-14 15:49:43,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 15:49:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-14 15:49:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:49:43,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:43,622 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:43,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -831690738, now seen corresponding path program 5 times [2019-01-14 15:49:43,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:43,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:43,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:43,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:44,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:44,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 15:49:44,353 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 15:49:44,628 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 15:49:44,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:44,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:44,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 15:49:44,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 15:49:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 15:49:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:49:44,679 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2019-01-14 15:49:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:44,755 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-14 15:49:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 15:49:44,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-14 15:49:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:44,757 INFO L225 Difference]: With dead ends: 34 [2019-01-14 15:49:44,757 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 15:49:44,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:49:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 15:49:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 15:49:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 15:49:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 15:49:44,762 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-01-14 15:49:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:44,762 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 15:49:44,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 15:49:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 15:49:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 15:49:44,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:44,763 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:44,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash -616519604, now seen corresponding path program 6 times [2019-01-14 15:49:44,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:44,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:44,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:45,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:45,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:49:45,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 15:49:47,063 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 15:49:47,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:47,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:47,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 15:49:47,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:49:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:49:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:49:47,113 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2019-01-14 15:49:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:47,192 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-14 15:49:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 15:49:47,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-14 15:49:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:47,193 INFO L225 Difference]: With dead ends: 36 [2019-01-14 15:49:47,194 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 15:49:47,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:49:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 15:49:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 15:49:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 15:49:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-14 15:49:47,198 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-01-14 15:49:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-14 15:49:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:49:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-14 15:49:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:49:47,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:47,200 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:47,200 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash 4509962, now seen corresponding path program 7 times [2019-01-14 15:49:47,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:47,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:47,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 15:49:47,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:47,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 15:49:47,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 15:49:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 15:49:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:49:47,538 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2019-01-14 15:49:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:47,624 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 15:49:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 15:49:47,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-01-14 15:49:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:47,626 INFO L225 Difference]: With dead ends: 38 [2019-01-14 15:49:47,626 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 15:49:47,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:49:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 15:49:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 15:49:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 15:49:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-14 15:49:47,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-01-14 15:49:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:47,631 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-14 15:49:47,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 15:49:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-14 15:49:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 15:49:47,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:47,633 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:47,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -186531256, now seen corresponding path program 8 times [2019-01-14 15:49:47,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:47,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:48,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:48,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:49:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:49:48,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:49:48,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:48,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:48,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:48,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 15:49:48,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:49:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:49:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:49:48,465 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-01-14 15:49:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:48,583 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-01-14 15:49:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:49:48,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-14 15:49:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:48,586 INFO L225 Difference]: With dead ends: 40 [2019-01-14 15:49:48,590 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 15:49:48,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:49:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 15:49:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-14 15:49:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 15:49:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-14 15:49:48,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-01-14 15:49:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:48,602 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-14 15:49:48,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:49:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-14 15:49:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:49:48,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:48,608 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:48,608 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash 906451974, now seen corresponding path program 9 times [2019-01-14 15:49:48,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:48,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:48,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:49,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:49,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 15:49:49,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:50:11,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 15:50:11,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:11,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:11,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:11,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 15:50:11,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 15:50:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 15:50:11,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 15:50:11,754 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 13 states. [2019-01-14 15:50:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:11,848 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-14 15:50:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 15:50:11,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-01-14 15:50:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:11,851 INFO L225 Difference]: With dead ends: 41 [2019-01-14 15:50:11,851 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 15:50:11,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 15:50:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 15:50:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 15:50:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 15:50:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-14 15:50:11,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-01-14 15:50:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:11,856 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-14 15:50:11,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 15:50:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-14 15:50:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:50:11,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:11,857 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:11,857 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:11,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1003651516, now seen corresponding path program 10 times [2019-01-14 15:50:11,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:11,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:50:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:50:12,318 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:50:12,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:50:12 BoogieIcfgContainer [2019-01-14 15:50:12,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:50:12,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:50:12,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:50:12,370 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:50:12,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:40" (3/4) ... [2019-01-14 15:50:12,374 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:50:12,462 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:50:12,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:50:12,467 INFO L168 Benchmark]: Toolchain (without parser) took 32548.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,470 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:12,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.44 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,471 INFO L168 Benchmark]: Boogie Preprocessor took 97.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,473 INFO L168 Benchmark]: RCFGBuilder took 521.04 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,474 INFO L168 Benchmark]: TraceAbstraction took 31398.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,474 INFO L168 Benchmark]: Witness Printer took 97.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:12,480 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 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 377.44 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 50.68 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 521.04 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31398.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. * Witness Printer took 97.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ [L28] COND FALSE !(j < 10) [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) [L40] COND FALSE !(i < *pa) [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 31.3s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 55 SDslu, 520 SDs, 0 SdLazy, 189 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=11, 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, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 25.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 16761 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...