./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i --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/reducercommutativity/rangesum05_false-unreach-call_true-termination.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 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11 19:05:51,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 19:05:51,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 19:05:51,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 19:05:51,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 19:05:51,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 19:05:51,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 19:05:51,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 19:05:51,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 19:05:51,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 19:05:51,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 19:05:51,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 19:05:51,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 19:05:51,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 19:05:51,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 19:05:51,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 19:05:51,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 19:05:51,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 19:05:51,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 19:05:51,714 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 19:05:51,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 19:05:51,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 19:05:51,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 19:05:51,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 19:05:51,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 19:05:51,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 19:05:51,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 19:05:51,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 19:05:51,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 19:05:51,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 19:05:51,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 19:05:51,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 19:05:51,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 19:05:51,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 19:05:51,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 19:05:51,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 19:05:51,729 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 19:05:51,745 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 19:05:51,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 19:05:51,747 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 19:05:51,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 19:05:51,747 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 19:05:51,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 19:05:51,748 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 19:05:51,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 19:05:51,749 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 19:05:51,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 19:05:51,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 19:05:51,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 19:05:51,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 19:05:51,750 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 19:05:51,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 19:05:51,750 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 19:05:51,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 19:05:51,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 19:05:51,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 19:05:51,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 19:05:51,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 19:05:51,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 19:05:51,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 19:05:51,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 19:05:51,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 19:05:51,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 19:05:51,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 19:05:51,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 19:05:51,755 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 -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2019-01-11 19:05:51,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 19:05:51,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 19:05:51,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 19:05:51,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 19:05:51,838 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 19:05:51,839 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-11 19:05:51,898 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218b11864/c45a4c52f0854b4cb29d8816803979f4/FLAGaf0a3131f [2019-01-11 19:05:52,308 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 19:05:52,309 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-11 19:05:52,316 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218b11864/c45a4c52f0854b4cb29d8816803979f4/FLAGaf0a3131f [2019-01-11 19:05:52,691 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218b11864/c45a4c52f0854b4cb29d8816803979f4 [2019-01-11 19:05:52,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 19:05:52,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 19:05:52,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 19:05:52,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 19:05:52,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 19:05:52,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:05:52" (1/1) ... [2019-01-11 19:05:52,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2515722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:52, skipping insertion in model container [2019-01-11 19:05:52,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:05:52" (1/1) ... [2019-01-11 19:05:52,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 19:05:52,740 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 19:05:52,976 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 19:05:52,991 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 19:05:53,041 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 19:05:53,062 INFO L195 MainTranslator]: Completed translation [2019-01-11 19:05:53,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53 WrapperNode [2019-01-11 19:05:53,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 19:05:53,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 19:05:53,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 19:05:53,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 19:05:53,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 19:05:53,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 19:05:53,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 19:05:53,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 19:05:53,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (1/1) ... [2019-01-11 19:05:53,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 19:05:53,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 19:05:53,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 19:05:53,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 19:05:53,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (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-11 19:05:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-11 19:05:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 19:05:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 19:05:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 19:05:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-11 19:05:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-11 19:05:53,837 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 19:05:53,838 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-11 19:05:53,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:05:53 BoogieIcfgContainer [2019-01-11 19:05:53,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 19:05:53,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 19:05:53,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 19:05:53,844 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 19:05:53,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:05:52" (1/3) ... [2019-01-11 19:05:53,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:05:53, skipping insertion in model container [2019-01-11 19:05:53,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:05:53" (2/3) ... [2019-01-11 19:05:53,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:05:53, skipping insertion in model container [2019-01-11 19:05:53,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:05:53" (3/3) ... [2019-01-11 19:05:53,848 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2019-01-11 19:05:53,857 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 19:05:53,864 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 19:05:53,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 19:05:53,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 19:05:53,913 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 19:05:53,913 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 19:05:53,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 19:05:53,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 19:05:53,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 19:05:53,914 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 19:05:53,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 19:05:53,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 19:05:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-11 19:05:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 19:05:53,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:53,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:53,941 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash -919167012, now seen corresponding path program 1 times [2019-01-11 19:05:53,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:53,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:53,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:53,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:54,064 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-11 19:05:54,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:54,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 19:05:54,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 19:05:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 19:05:54,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 19:05:54,090 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-11 19:05:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:54,109 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2019-01-11 19:05:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 19:05:54,110 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-01-11 19:05:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:54,119 INFO L225 Difference]: With dead ends: 56 [2019-01-11 19:05:54,119 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 19:05:54,123 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-11 19:05:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 19:05:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-11 19:05:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 19:05:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-11 19:05:54,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2019-01-11 19:05:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:54,155 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-11 19:05:54,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 19:05:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-11 19:05:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 19:05:54,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:54,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:54,156 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash 164788593, now seen corresponding path program 1 times [2019-01-11 19:05:54,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:54,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:54,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,170 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:54,170 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:54,171 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:54,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:54,272 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-11 19:05:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 19:05:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 19:05:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 19:05:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 19:05:54,296 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 3 states. [2019-01-11 19:05:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:54,333 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2019-01-11 19:05:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 19:05:54,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 19:05:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:54,335 INFO L225 Difference]: With dead ends: 50 [2019-01-11 19:05:54,335 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 19:05:54,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-11 19:05:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 19:05:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-11 19:05:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 19:05:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-11 19:05:54,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2019-01-11 19:05:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:54,344 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-11 19:05:54,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 19:05:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-11 19:05:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 19:05:54,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:54,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:54,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1403287377, now seen corresponding path program 1 times [2019-01-11 19:05:54,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,370 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:54,370 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:54,370 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:54,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:54,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 19:05:54,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:54,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 19:05:54,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 19:05:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 19:05:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 19:05:54,520 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2019-01-11 19:05:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:54,718 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2019-01-11 19:05:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 19:05:54,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 19:05:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:54,720 INFO L225 Difference]: With dead ends: 57 [2019-01-11 19:05:54,720 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 19:05:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-11 19:05:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 19:05:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-01-11 19:05:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 19:05:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-11 19:05:54,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2019-01-11 19:05:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:54,728 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-11 19:05:54,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 19:05:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-01-11 19:05:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 19:05:54,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:54,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:54,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:54,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1132417868, now seen corresponding path program 1 times [2019-01-11 19:05:54,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:54,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:54,743 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:54,743 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:54,744 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:54,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 19:05:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 19:05:54,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 19:05:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 19:05:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 19:05:54,925 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2019-01-11 19:05:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:55,114 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2019-01-11 19:05:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 19:05:55,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-11 19:05:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:55,115 INFO L225 Difference]: With dead ends: 75 [2019-01-11 19:05:55,116 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 19:05:55,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-11 19:05:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 19:05:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-11 19:05:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 19:05:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-01-11 19:05:55,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 28 [2019-01-11 19:05:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:55,125 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-01-11 19:05:55,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 19:05:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2019-01-11 19:05:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 19:05:55,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:55,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:55,127 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1168464304, now seen corresponding path program 1 times [2019-01-11 19:05:55,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:55,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:55,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 19:05:55,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:55,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 19:05:55,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 19:05:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 19:05:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:55,208 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 4 states. [2019-01-11 19:05:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:55,330 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2019-01-11 19:05:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 19:05:55,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-01-11 19:05:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:55,333 INFO L225 Difference]: With dead ends: 85 [2019-01-11 19:05:55,333 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 19:05:55,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 19:05:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-11 19:05:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 19:05:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-01-11 19:05:55,340 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2019-01-11 19:05:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-01-11 19:05:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 19:05:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-01-11 19:05:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 19:05:55,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:55,343 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:55,343 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -483510003, now seen corresponding path program 1 times [2019-01-11 19:05:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:55,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,369 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:55,370 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:55,370 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:55,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 19:05:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:55,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 19:05:55,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 19:05:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 19:05:55,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 19:05:55,526 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 3 states. [2019-01-11 19:05:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:55,543 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-01-11 19:05:55,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 19:05:55,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-11 19:05:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:55,547 INFO L225 Difference]: With dead ends: 54 [2019-01-11 19:05:55,547 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 19:05:55,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-11 19:05:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 19:05:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-11 19:05:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 19:05:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-11 19:05:55,554 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 37 [2019-01-11 19:05:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:55,554 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-11 19:05:55,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 19:05:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-11 19:05:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 19:05:55,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:55,556 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:55,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash -623311861, now seen corresponding path program 1 times [2019-01-11 19:05:55,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:55,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,568 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:55,568 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:55,568 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:55,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:55,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 19:05:55,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:55,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-11 19:05:55,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 19:05:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 19:05:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:55,706 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 4 states. [2019-01-11 19:05:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:55,730 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2019-01-11 19:05:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 19:05:55,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-11 19:05:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:55,734 INFO L225 Difference]: With dead ends: 78 [2019-01-11 19:05:55,734 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 19:05:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 19:05:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-11 19:05:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 19:05:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-11 19:05:55,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2019-01-11 19:05:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:55,741 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-11 19:05:55,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 19:05:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-11 19:05:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 19:05:55,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:55,743 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:55,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash -526389047, now seen corresponding path program 2 times [2019-01-11 19:05:55,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:55,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:55,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:55,758 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:55,759 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:55,759 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:55,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 19:05:55,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 19:05:55,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:55,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 19:05:55,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:55,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-11 19:05:55,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 19:05:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 19:05:55,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:55,912 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-11 19:05:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:56,117 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-01-11 19:05:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 19:05:56,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-01-11 19:05:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:56,118 INFO L225 Difference]: With dead ends: 86 [2019-01-11 19:05:56,118 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 19:05:56,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 19:05:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-11 19:05:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 19:05:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-01-11 19:05:56,126 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 41 [2019-01-11 19:05:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:56,126 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-01-11 19:05:56,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 19:05:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-01-11 19:05:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 19:05:56,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:56,128 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:56,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1393104750, now seen corresponding path program 3 times [2019-01-11 19:05:56,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:56,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:56,143 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:56,144 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:56,144 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:56,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 19:05:56,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 19:05:56,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:56,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-11 19:05:56,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:56,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-11 19:05:56,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 19:05:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 19:05:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:56,376 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 4 states. [2019-01-11 19:05:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:56,530 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-01-11 19:05:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 19:05:56,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-11 19:05:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:56,534 INFO L225 Difference]: With dead ends: 70 [2019-01-11 19:05:56,534 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 19:05:56,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 19:05:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-11 19:05:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 19:05:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-01-11 19:05:56,550 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 50 [2019-01-11 19:05:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:56,551 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-01-11 19:05:56,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 19:05:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-01-11 19:05:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 19:05:56,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:56,553 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:56,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1656359148, now seen corresponding path program 4 times [2019-01-11 19:05:56,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:56,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:56,586 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:56,586 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:56,586 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 19:05:56,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 19:05:56,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:56,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-11 19:05:56,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:56,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-11 19:05:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 19:05:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 19:05:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 19:05:56,850 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 5 states. [2019-01-11 19:05:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:57,062 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2019-01-11 19:05:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 19:05:57,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-01-11 19:05:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:57,065 INFO L225 Difference]: With dead ends: 102 [2019-01-11 19:05:57,065 INFO L226 Difference]: Without dead ends: 62 [2019-01-11 19:05:57,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 19:05:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-11 19:05:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-11 19:05:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 19:05:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-01-11 19:05:57,073 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 52 [2019-01-11 19:05:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:57,073 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-01-11 19:05:57,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 19:05:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-01-11 19:05:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-11 19:05:57,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:57,075 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:57,075 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2133276057, now seen corresponding path program 5 times [2019-01-11 19:05:57,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,089 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:57,089 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:57,089 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-11 19:05:57,145 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-11 19:05:57,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:57,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-11 19:05:57,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 19:05:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 19:05:57,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 19:05:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 19:05:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:57,195 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-01-11 19:05:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:57,264 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2019-01-11 19:05:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 19:05:57,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-11 19:05:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:57,266 INFO L225 Difference]: With dead ends: 111 [2019-01-11 19:05:57,266 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 19:05:57,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 19:05:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 19:05:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-01-11 19:05:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 19:05:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-01-11 19:05:57,276 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 61 [2019-01-11 19:05:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:57,276 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-01-11 19:05:57,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 19:05:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-01-11 19:05:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-11 19:05:57,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:57,278 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:57,278 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2021142629, now seen corresponding path program 1 times [2019-01-11 19:05:57,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,297 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:57,297 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:57,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 19:05:57,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 19:05:57,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:57,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-11 19:05:57,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 19:05:57,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 19:05:57,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 19:05:57,493 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 5 states. [2019-01-11 19:05:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:57,525 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-01-11 19:05:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 19:05:57,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-01-11 19:05:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:57,528 INFO L225 Difference]: With dead ends: 120 [2019-01-11 19:05:57,528 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 19:05:57,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 19:05:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 19:05:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-11 19:05:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 19:05:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-01-11 19:05:57,541 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 61 [2019-01-11 19:05:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:57,541 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-01-11 19:05:57,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 19:05:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-01-11 19:05:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-11 19:05:57,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:57,543 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:57,543 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:57,544 INFO L82 PathProgramCache]: Analyzing trace with hash 265673379, now seen corresponding path program 2 times [2019-01-11 19:05:57,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:57,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:57,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:05:57,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:57,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:57,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 19:05:57,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 19:05:57,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:57,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 19:05:57,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:57,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-11 19:05:57,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 19:05:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 19:05:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 19:05:57,722 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 6 states. [2019-01-11 19:05:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:57,777 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-01-11 19:05:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 19:05:57,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-11 19:05:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:57,782 INFO L225 Difference]: With dead ends: 122 [2019-01-11 19:05:57,782 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 19:05:57,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 19:05:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 19:05:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-11 19:05:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 19:05:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-01-11 19:05:57,792 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 63 [2019-01-11 19:05:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:57,792 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-01-11 19:05:57,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 19:05:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-01-11 19:05:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 19:05:57,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:57,808 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:57,808 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1181871457, now seen corresponding path program 3 times [2019-01-11 19:05:57,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:57,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:57,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:57,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:57,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 19:05:57,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 19:05:57,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:57,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-01-11 19:05:57,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:57,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-11 19:05:57,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 19:05:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 19:05:57,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 19:05:57,970 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2019-01-11 19:05:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:57,992 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-01-11 19:05:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 19:05:57,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-11 19:05:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:57,995 INFO L225 Difference]: With dead ends: 88 [2019-01-11 19:05:57,995 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 19:05:57,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-11 19:05:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 19:05:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-11 19:05:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 19:05:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-01-11 19:05:58,003 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 65 [2019-01-11 19:05:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:58,003 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-01-11 19:05:58,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 19:05:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-01-11 19:05:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 19:05:58,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:58,004 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:58,004 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1302328097, now seen corresponding path program 4 times [2019-01-11 19:05:58,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:58,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,016 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:58,017 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:58,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:58,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 19:05:58,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 19:05:58,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:58,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-11 19:05:58,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:58,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-11 19:05:58,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 19:05:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 19:05:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 19:05:58,195 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 7 states. [2019-01-11 19:05:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:58,393 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2019-01-11 19:05:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 19:05:58,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-11 19:05:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:58,395 INFO L225 Difference]: With dead ends: 120 [2019-01-11 19:05:58,395 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 19:05:58,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 19:05:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 19:05:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 19:05:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 19:05:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-01-11 19:05:58,405 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 67 [2019-01-11 19:05:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:58,405 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-01-11 19:05:58,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 19:05:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-01-11 19:05:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 19:05:58,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:58,407 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:58,407 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash -153484414, now seen corresponding path program 5 times [2019-01-11 19:05:58,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:58,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:58,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:58,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-11 19:05:58,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-11 19:05:58,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:05:58,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:05:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-01-11 19:05:58,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:05:58,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-11 19:05:58,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 19:05:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 19:05:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 19:05:58,580 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2019-01-11 19:05:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:05:58,644 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2019-01-11 19:05:58,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 19:05:58,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-11 19:05:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:05:58,647 INFO L225 Difference]: With dead ends: 145 [2019-01-11 19:05:58,647 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 19:05:58,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 19:05:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 19:05:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 19:05:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 19:05:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-01-11 19:05:58,655 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 76 [2019-01-11 19:05:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:05:58,655 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-01-11 19:05:58,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 19:05:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-01-11 19:05:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 19:05:58,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:05:58,656 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:05:58,656 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:05:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:05:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1735993980, now seen corresponding path program 6 times [2019-01-11 19:05:58,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:05:58,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:05:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:05:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:05:58,678 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:05:58,680 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:05:58,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:05:58,704 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-11 19:06:00,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-01-11 19:06:00,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 19:06:00,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 19:06:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-11 19:06:00,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 19:06:00,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-11 19:06:00,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 19:06:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 19:06:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 19:06:00,612 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2019-01-11 19:06:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 19:06:00,662 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2019-01-11 19:06:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 19:06:00,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-01-11 19:06:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 19:06:00,663 INFO L225 Difference]: With dead ends: 103 [2019-01-11 19:06:00,663 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 19:06:00,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 19:06:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 19:06:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 19:06:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 19:06:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-01-11 19:06:00,668 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2019-01-11 19:06:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 19:06:00,669 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-01-11 19:06:00,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 19:06:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-01-11 19:06:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 19:06:00,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 19:06:00,670 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 19:06:00,670 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 19:06:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 19:06:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1345801862, now seen corresponding path program 7 times [2019-01-11 19:06:00,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 19:06:00,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 19:06:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:06:00,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 19:06:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 19:06:00,683 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 19:06:00,684 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 19:06:00,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 19:06:00,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 19:06:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 19:06:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 19:06:00,989 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 19:06:01,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:06:01 BoogieIcfgContainer [2019-01-11 19:06:01,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 19:06:01,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 19:06:01,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 19:06:01,105 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 19:06:01,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:05:53" (3/4) ... [2019-01-11 19:06:01,108 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 19:06:01,220 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 19:06:01,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 19:06:01,222 INFO L168 Benchmark]: Toolchain (without parser) took 8523.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -65.3 MB). Peak memory consumption was 137.6 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,223 INFO L168 Benchmark]: CDTParser took 0.21 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-11 19:06:01,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.59 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,225 INFO L168 Benchmark]: Boogie Preprocessor took 105.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,225 INFO L168 Benchmark]: RCFGBuilder took 603.08 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,228 INFO L168 Benchmark]: TraceAbstraction took 7264.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,228 INFO L168 Benchmark]: Witness Printer took 115.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-11 19:06:01,233 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.21 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 363.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 65.59 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 603.08 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7264.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. * Witness Printer took 115.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[5]; [L5] int i; [L6] i = 0 [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 5) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 5) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 5) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<5 -1) [L46] x[5 -1] = temp [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND FALSE !(i > 5/2) [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 5 [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 5) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 7.1s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 523 SDtfs, 187 SDslu, 565 SDs, 0 SdLazy, 304 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=17, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 46 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 879 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 52874 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2293 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 745/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...