./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/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-2e94e6a [2018-12-30 13:51:44,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 13:51:44,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 13:51:44,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 13:51:44,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 13:51:44,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 13:51:44,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 13:51:44,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 13:51:44,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 13:51:44,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 13:51:44,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 13:51:44,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 13:51:44,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 13:51:44,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 13:51:44,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 13:51:44,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 13:51:44,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 13:51:44,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 13:51:44,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 13:51:44,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 13:51:44,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 13:51:44,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 13:51:44,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 13:51:44,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 13:51:44,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 13:51:44,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 13:51:44,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 13:51:44,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 13:51:44,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 13:51:44,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 13:51:44,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 13:51:44,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 13:51:44,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 13:51:44,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 13:51:44,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 13:51:44,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 13:51:44,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 13:51:44,190 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 13:51:44,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 13:51:44,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 13:51:44,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 13:51:44,192 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 13:51:44,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 13:51:44,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 13:51:44,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 13:51:44,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 13:51:44,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 13:51:44,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 13:51:44,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 13:51:44,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 13:51:44,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 13:51:44,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 13:51:44,196 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 13:51:44,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 13:51:44,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 13:51:44,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 13:51:44,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 13:51:44,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 13:51:44,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 13:51:44,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 13:51:44,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 13:51:44,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 13:51:44,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 13:51:44,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 13:51:44,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 13:51:44,202 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 [2018-12-30 13:51:44,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 13:51:44,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 13:51:44,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 13:51:44,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 13:51:44,278 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 13:51:44,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-12-30 13:51:44,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d67833d/3c169cb42fba462998318b3736952c04/FLAGa0bc780cd [2018-12-30 13:51:44,804 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 13:51:44,804 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-12-30 13:51:44,812 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d67833d/3c169cb42fba462998318b3736952c04/FLAGa0bc780cd [2018-12-30 13:51:45,174 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d67833d/3c169cb42fba462998318b3736952c04 [2018-12-30 13:51:45,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 13:51:45,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 13:51:45,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 13:51:45,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 13:51:45,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 13:51:45,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aaa2244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45, skipping insertion in model container [2018-12-30 13:51:45,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 13:51:45,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 13:51:45,499 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 13:51:45,516 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 13:51:45,566 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 13:51:45,586 INFO L195 MainTranslator]: Completed translation [2018-12-30 13:51:45,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45 WrapperNode [2018-12-30 13:51:45,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 13:51:45,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 13:51:45,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 13:51:45,588 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 13:51:45,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 13:51:45,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 13:51:45,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 13:51:45,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 13:51:45,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... [2018-12-30 13:51:45,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 13:51:45,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 13:51:45,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 13:51:45,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 13:51:45,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 13:51:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-30 13:51:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 13:51:45,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 13:51:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-30 13:51:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-30 13:51:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-30 13:51:46,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 13:51:46,422 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-30 13:51:46,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 01:51:46 BoogieIcfgContainer [2018-12-30 13:51:46,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 13:51:46,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 13:51:46,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 13:51:46,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 13:51:46,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 01:51:45" (1/3) ... [2018-12-30 13:51:46,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe5863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 01:51:46, skipping insertion in model container [2018-12-30 13:51:46,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 01:51:45" (2/3) ... [2018-12-30 13:51:46,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe5863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 01:51:46, skipping insertion in model container [2018-12-30 13:51:46,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 01:51:46" (3/3) ... [2018-12-30 13:51:46,430 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-12-30 13:51:46,439 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 13:51:46,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 13:51:46,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 13:51:46,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 13:51:46,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 13:51:46,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 13:51:46,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 13:51:46,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 13:51:46,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 13:51:46,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 13:51:46,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 13:51:46,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 13:51:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-30 13:51:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 13:51:46,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:46,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 13:51:46,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -919167012, now seen corresponding path program 1 times [2018-12-30 13:51:46,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:46,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:46,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 13:51:46,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:46,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 13:51:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-30 13:51:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-30 13:51:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 13:51:46,692 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-12-30 13:51:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:46,710 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2018-12-30 13:51:46,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-30 13:51:46,711 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-30 13:51:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:46,720 INFO L225 Difference]: With dead ends: 56 [2018-12-30 13:51:46,721 INFO L226 Difference]: Without dead ends: 26 [2018-12-30 13:51:46,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 13:51:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-30 13:51:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-30 13:51:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-30 13:51:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-12-30 13:51:46,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2018-12-30 13:51:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:46,760 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-30 13:51:46,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-30 13:51:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-12-30 13:51:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 13:51:46,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:46,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 13:51:46,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 164788593, now seen corresponding path program 1 times [2018-12-30 13:51:46,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:46,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:46,776 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:46,777 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:46,777 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 [2018-12-30 13:51:46,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:46,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 13:51:46,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:46,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 13:51:46,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 13:51:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 13:51:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 13:51:46,908 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 3 states. [2018-12-30 13:51:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:46,973 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-12-30 13:51:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 13:51:46,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 13:51:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:46,977 INFO L225 Difference]: With dead ends: 50 [2018-12-30 13:51:46,978 INFO L226 Difference]: Without dead ends: 28 [2018-12-30 13:51:46,979 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 [2018-12-30 13:51:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-30 13:51:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-30 13:51:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-30 13:51:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-30 13:51:46,990 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-12-30 13:51:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-30 13:51:46,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 13:51:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-30 13:51:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 13:51:46,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:46,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 13:51:46,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1403287377, now seen corresponding path program 1 times [2018-12-30 13:51:46,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:46,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,027 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:47,028 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:47,028 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 [2018-12-30 13:51:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:47,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-30 13:51:47,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:47,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 13:51:47,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 13:51:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 13:51:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 13:51:47,148 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-30 13:51:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:47,292 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-12-30 13:51:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 13:51:47,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 13:51:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:47,294 INFO L225 Difference]: With dead ends: 57 [2018-12-30 13:51:47,294 INFO L226 Difference]: Without dead ends: 36 [2018-12-30 13:51:47,295 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 [2018-12-30 13:51:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-30 13:51:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-30 13:51:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-30 13:51:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-30 13:51:47,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2018-12-30 13:51:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:47,302 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-30 13:51:47,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 13:51:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-12-30 13:51:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 13:51:47,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:47,303 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] [2018-12-30 13:51:47,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1132417868, now seen corresponding path program 1 times [2018-12-30 13:51:47,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:47,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:47,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,318 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:47,318 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:47,319 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 [2018-12-30 13:51:47,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:47,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-30 13:51:47,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:47,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 13:51:47,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 13:51:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 13:51:47,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 13:51:47,499 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-12-30 13:51:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:47,612 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-12-30 13:51:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 13:51:47,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 13:51:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:47,615 INFO L225 Difference]: With dead ends: 75 [2018-12-30 13:51:47,615 INFO L226 Difference]: Without dead ends: 54 [2018-12-30 13:51:47,616 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 [2018-12-30 13:51:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-30 13:51:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-30 13:51:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-30 13:51:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2018-12-30 13:51:47,626 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 28 [2018-12-30 13:51:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:47,627 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2018-12-30 13:51:47,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 13:51:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2018-12-30 13:51:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 13:51:47,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:47,628 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] [2018-12-30 13:51:47,629 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1168464304, now seen corresponding path program 1 times [2018-12-30 13:51:47,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 13:51:47,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:47,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 13:51:47,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 13:51:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 13:51:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:47,711 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 4 states. [2018-12-30 13:51:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:47,933 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2018-12-30 13:51:47,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 13:51:47,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-30 13:51:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:47,935 INFO L225 Difference]: With dead ends: 85 [2018-12-30 13:51:47,936 INFO L226 Difference]: Without dead ends: 54 [2018-12-30 13:51:47,937 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 [2018-12-30 13:51:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-30 13:51:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-30 13:51:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-30 13:51:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-12-30 13:51:47,945 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2018-12-30 13:51:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:47,945 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-12-30 13:51:47,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 13:51:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-12-30 13:51:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 13:51:47,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:47,947 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] [2018-12-30 13:51:47,947 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -483510003, now seen corresponding path program 1 times [2018-12-30 13:51:47,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:47,963 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:47,963 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:47,963 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 [2018-12-30 13:51:47,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:48,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 13:51:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:48,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 13:51:48,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 13:51:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 13:51:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 13:51:48,099 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 3 states. [2018-12-30 13:51:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:48,184 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-12-30 13:51:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 13:51:48,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-30 13:51:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:48,187 INFO L225 Difference]: With dead ends: 54 [2018-12-30 13:51:48,187 INFO L226 Difference]: Without dead ends: 41 [2018-12-30 13:51:48,188 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 [2018-12-30 13:51:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-30 13:51:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-30 13:51:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-30 13:51:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-12-30 13:51:48,195 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 37 [2018-12-30 13:51:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:48,196 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-12-30 13:51:48,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 13:51:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-12-30 13:51:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 13:51:48,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:48,198 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] [2018-12-30 13:51:48,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash -623311861, now seen corresponding path program 1 times [2018-12-30 13:51:48,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:48,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:48,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:48,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:48,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:48,214 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:48,214 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:48,214 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 [2018-12-30 13:51:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:48,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 13:51:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-12-30 13:51:48,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 13:51:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 13:51:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:48,431 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 4 states. [2018-12-30 13:51:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:48,559 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2018-12-30 13:51:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 13:51:48,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-30 13:51:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:48,560 INFO L225 Difference]: With dead ends: 78 [2018-12-30 13:51:48,561 INFO L226 Difference]: Without dead ends: 43 [2018-12-30 13:51:48,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-30 13:51:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-30 13:51:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-30 13:51:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-12-30 13:51:48,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2018-12-30 13:51:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:48,568 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-12-30 13:51:48,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 13:51:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-12-30 13:51:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 13:51:48,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:48,569 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] [2018-12-30 13:51:48,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash -526389047, now seen corresponding path program 2 times [2018-12-30 13:51:48,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:48,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:48,585 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:48,585 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:48,585 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 [2018-12-30 13:51:48,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 13:51:48,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 13:51:48,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:48,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 13:51:48,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-12-30 13:51:48,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 13:51:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 13:51:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:48,811 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2018-12-30 13:51:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:49,040 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2018-12-30 13:51:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 13:51:49,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-30 13:51:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:49,047 INFO L225 Difference]: With dead ends: 86 [2018-12-30 13:51:49,047 INFO L226 Difference]: Without dead ends: 54 [2018-12-30 13:51:49,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-30 13:51:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-12-30 13:51:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-30 13:51:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-12-30 13:51:49,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 41 [2018-12-30 13:51:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:49,062 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-12-30 13:51:49,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 13:51:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-12-30 13:51:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 13:51:49,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:49,066 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] [2018-12-30 13:51:49,066 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1393104750, now seen corresponding path program 3 times [2018-12-30 13:51:49,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:49,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:49,102 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:49,104 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:49,104 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 [2018-12-30 13:51:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 13:51:49,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-30 13:51:49,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:49,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-30 13:51:49,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-12-30 13:51:49,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 13:51:49,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 13:51:49,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:49,350 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 4 states. [2018-12-30 13:51:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:49,524 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-12-30 13:51:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 13:51:49,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-30 13:51:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:49,530 INFO L225 Difference]: With dead ends: 70 [2018-12-30 13:51:49,530 INFO L226 Difference]: Without dead ends: 54 [2018-12-30 13:51:49,531 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 [2018-12-30 13:51:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-30 13:51:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-30 13:51:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-30 13:51:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-12-30 13:51:49,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 50 [2018-12-30 13:51:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:49,546 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-30 13:51:49,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 13:51:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-12-30 13:51:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-30 13:51:49,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:49,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] [2018-12-30 13:51:49,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1656359148, now seen corresponding path program 4 times [2018-12-30 13:51:49,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:49,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:49,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:49,587 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:49,588 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:49,588 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 [2018-12-30 13:51:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 13:51:49,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 13:51:49,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:49,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-30 13:51:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-30 13:51:49,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 13:51:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 13:51:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 13:51:49,724 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 5 states. [2018-12-30 13:51:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:49,994 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-12-30 13:51:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 13:51:49,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-30 13:51:49,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:49,997 INFO L225 Difference]: With dead ends: 102 [2018-12-30 13:51:49,997 INFO L226 Difference]: Without dead ends: 62 [2018-12-30 13:51:49,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 13:51:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-30 13:51:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-30 13:51:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-30 13:51:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-12-30 13:51:50,006 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 52 [2018-12-30 13:51:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:50,006 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-12-30 13:51:50,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 13:51:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-12-30 13:51:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-30 13:51:50,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:50,007 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] [2018-12-30 13:51:50,008 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2133276057, now seen corresponding path program 5 times [2018-12-30 13:51:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,022 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:50,022 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:50,022 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 [2018-12-30 13:51:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 13:51:50,085 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-12-30 13:51:50,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:50,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-30 13:51:50,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 13:51:50,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 13:51:50,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 13:51:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 13:51:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 13:51:50,130 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2018-12-30 13:51:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:50,220 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-12-30 13:51:50,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 13:51:50,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-30 13:51:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:50,222 INFO L225 Difference]: With dead ends: 111 [2018-12-30 13:51:50,222 INFO L226 Difference]: Without dead ends: 71 [2018-12-30 13:51:50,222 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 [2018-12-30 13:51:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-30 13:51:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-12-30 13:51:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-30 13:51:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-30 13:51:50,230 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 61 [2018-12-30 13:51:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:50,230 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-30 13:51:50,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 13:51:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-30 13:51:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-30 13:51:50,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:50,231 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] [2018-12-30 13:51:50,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2021142629, now seen corresponding path program 1 times [2018-12-30 13:51:50,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:50,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,244 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:50,244 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:50,244 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 [2018-12-30 13:51:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 13:51:50,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 13:51:50,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-30 13:51:50,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 13:51:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 13:51:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 13:51:50,500 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 5 states. [2018-12-30 13:51:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:50,536 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-12-30 13:51:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 13:51:50,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-30 13:51:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:50,538 INFO L225 Difference]: With dead ends: 120 [2018-12-30 13:51:50,538 INFO L226 Difference]: Without dead ends: 65 [2018-12-30 13:51:50,539 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 [2018-12-30 13:51:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-30 13:51:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-30 13:51:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-30 13:51:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-12-30 13:51:50,548 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 61 [2018-12-30 13:51:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:50,548 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-12-30 13:51:50,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 13:51:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-12-30 13:51:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-30 13:51:50,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:50,550 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] [2018-12-30 13:51:50,551 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash 265673379, now seen corresponding path program 2 times [2018-12-30 13:51:50,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,569 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:50,569 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:50,569 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 [2018-12-30 13:51:50,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 13:51:50,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 13:51:50,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:50,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 13:51:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:50,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-30 13:51:50,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 13:51:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 13:51:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 13:51:50,751 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 6 states. [2018-12-30 13:51:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:50,795 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-12-30 13:51:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 13:51:50,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-30 13:51:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:50,798 INFO L225 Difference]: With dead ends: 122 [2018-12-30 13:51:50,798 INFO L226 Difference]: Without dead ends: 67 [2018-12-30 13:51:50,798 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 [2018-12-30 13:51:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-30 13:51:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-30 13:51:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-30 13:51:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-12-30 13:51:50,810 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 63 [2018-12-30 13:51:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:50,810 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-12-30 13:51:50,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 13:51:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-12-30 13:51:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-30 13:51:50,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:50,812 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] [2018-12-30 13:51:50,812 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1181871457, now seen corresponding path program 3 times [2018-12-30 13:51:50,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:50,846 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:50,846 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:50,846 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 [2018-12-30 13:51:50,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 13:51:50,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-30 13:51:50,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:50,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-30 13:51:50,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:50,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-30 13:51:50,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 13:51:50,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 13:51:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 13:51:50,978 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-12-30 13:51:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:51,009 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-12-30 13:51:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 13:51:51,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-30 13:51:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:51,014 INFO L225 Difference]: With dead ends: 88 [2018-12-30 13:51:51,014 INFO L226 Difference]: Without dead ends: 69 [2018-12-30 13:51:51,016 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 [2018-12-30 13:51:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-30 13:51:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-30 13:51:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-30 13:51:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-12-30 13:51:51,023 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 65 [2018-12-30 13:51:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:51,023 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-12-30 13:51:51,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 13:51:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-12-30 13:51:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 13:51:51,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:51,027 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] [2018-12-30 13:51:51,027 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1302328097, now seen corresponding path program 4 times [2018-12-30 13:51:51,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,043 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:51,043 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:51,043 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 [2018-12-30 13:51:51,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 13:51:51,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 13:51:51,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:51,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-30 13:51:51,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:51,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-12-30 13:51:51,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 13:51:51,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 13:51:51,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 13:51:51,184 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 7 states. [2018-12-30 13:51:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:51,350 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2018-12-30 13:51:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 13:51:51,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-30 13:51:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:51,351 INFO L225 Difference]: With dead ends: 120 [2018-12-30 13:51:51,352 INFO L226 Difference]: Without dead ends: 77 [2018-12-30 13:51:51,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 13:51:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-30 13:51:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-30 13:51:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-30 13:51:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-12-30 13:51:51,361 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 67 [2018-12-30 13:51:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:51,361 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-12-30 13:51:51,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 13:51:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-12-30 13:51:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-30 13:51:51,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:51,362 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] [2018-12-30 13:51:51,363 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash -153484414, now seen corresponding path program 5 times [2018-12-30 13:51:51,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:51,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,388 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:51,388 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:51,389 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 [2018-12-30 13:51:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 13:51:51,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-30 13:51:51,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:51,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-30 13:51:51,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:51,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-12-30 13:51:51,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 13:51:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 13:51:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 13:51:51,577 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-12-30 13:51:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:51,652 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2018-12-30 13:51:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 13:51:51,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-30 13:51:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:51,653 INFO L225 Difference]: With dead ends: 145 [2018-12-30 13:51:51,653 INFO L226 Difference]: Without dead ends: 79 [2018-12-30 13:51:51,654 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 [2018-12-30 13:51:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-30 13:51:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-30 13:51:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-30 13:51:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-12-30 13:51:51,660 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 76 [2018-12-30 13:51:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:51,660 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-12-30 13:51:51,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 13:51:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-12-30 13:51:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-30 13:51:51,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:51,661 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] [2018-12-30 13:51:51,661 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1735993980, now seen corresponding path program 6 times [2018-12-30 13:51:51,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:51,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:51,676 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:51,676 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:51,676 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 [2018-12-30 13:51:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-30 13:51:53,839 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-30 13:51:53,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 13:51:53,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 13:51:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 13:51:53,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 13:51:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-30 13:51:53,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 13:51:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 13:51:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 13:51:53,893 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2018-12-30 13:51:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 13:51:53,933 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-12-30 13:51:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 13:51:53,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-30 13:51:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 13:51:53,934 INFO L225 Difference]: With dead ends: 103 [2018-12-30 13:51:53,934 INFO L226 Difference]: Without dead ends: 81 [2018-12-30 13:51:53,935 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 [2018-12-30 13:51:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-30 13:51:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-30 13:51:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-30 13:51:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-12-30 13:51:53,940 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2018-12-30 13:51:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 13:51:53,940 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-12-30 13:51:53,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 13:51:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-12-30 13:51:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-30 13:51:53,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 13:51:53,941 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] [2018-12-30 13:51:53,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 13:51:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 13:51:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1345801862, now seen corresponding path program 7 times [2018-12-30 13:51:53,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 13:51:53,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 13:51:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:53,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 13:51:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 13:51:53,955 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 13:51:53,955 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 13:51:53,955 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 [2018-12-30 13:51:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 13:51:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 13:51:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 13:51:54,283 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 13:51:54,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 01:51:54 BoogieIcfgContainer [2018-12-30 13:51:54,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 13:51:54,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 13:51:54,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 13:51:54,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 13:51:54,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 01:51:46" (3/4) ... [2018-12-30 13:51:54,447 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 13:51:54,551 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 13:51:54,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 13:51:54,553 INFO L168 Benchmark]: Toolchain (without parser) took 9373.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -68.2 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2018-12-30 13:51:54,554 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 13:51:54,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.74 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. [2018-12-30 13:51:54,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.30 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. [2018-12-30 13:51:54,556 INFO L168 Benchmark]: Boogie Preprocessor took 105.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-30 13:51:54,557 INFO L168 Benchmark]: RCFGBuilder took 669.86 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. [2018-12-30 13:51:54,557 INFO L168 Benchmark]: TraceAbstraction took 8019.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.0 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2018-12-30 13:51:54,558 INFO L168 Benchmark]: Witness Printer took 108.48 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. [2018-12-30 13:51:54,562 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.74 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 58.30 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.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 669.86 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 8019.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.0 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. * Witness Printer took 108.48 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.9s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 2.0s 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.5s 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.6s 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...